Sandbox for Proposed Challenges

Question

This "sandbox" 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.

Sandbox FAQ

Posting

To post to the sandbox, scroll to the bottom of this page and click "Answer This Question". Click "OK" when it asks if you really want to add another answer.

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.

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 delete the sandbox post.

Discussion

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:

• Parts of the challenge you found unclear
• Comments addressing specific points mentioned in the proposal
• Problems that could make the challenge uninteresting or unfit for the site

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.

If you think one of your posts requires more feedback, but it's been ignored, you can ask for feedback in The Nineteenth Byte. It's not only allowed, but highly recommended! Be patient and try not to nag people though, you might have to ask multiple times.

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.

Other

Search the sandbox / Browse your pending proposals

The sandbox works best if you sort posts by active.

To add an inline tag to a proposal, use shortcut link syntax with a prefix: [tag:king-of-the-hill]. To search for posts with a certain tag, include the name in quotes: "king-of-the-hill".

Answer 1

Solve a Quartic Equation

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.

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.

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).

On advice from TNB, builtins are now banned The formula for reference:

For a quartic equation \$ax^4 + bx^3 + cx^2 + dx + e = 0\$:

\$x_1, x_2 = \frac{-b}{4a} - S \pm \frac{1}{2}\sqrt[]{4S^2 - 2p + \frac{q}{S}}\$

\$x_3, x_4 = \frac{-b}{4a} + S \pm \frac{1}{2}\sqrt[]{4S^2 - 2p + \frac{q}{S}}\$

where:

\$p = \dfrac{8ac - 3b^2}{8a^2},\$ \$q = \dfrac{b^3 - 4abc + 8a^2d}{8a^3}\$

where:

\$S = \frac{1}{2}\sqrt[]{-\frac{2}{3}p + \frac{1}{3a}\left(Q + \frac{\Delta_0}{Q}\right)},\$ \$Q = \sqrt[3]{\frac{\Delta_1 + \sqrt[]{\Delta_1^2 - 4\Delta_0^3}}{2}}\$

and where:

\$\Delta_0 = c^2 - 3bd + 12ae,\$ \$\Delta_1 = 2c^3 - 9bcd + 27b^2e + 27ad^2 - 72ace\$

I learnt LaTeX just to do all those formulae. I hope you're proud of me. As always, this is code-golf, so shortest wins.

Tags: code-golfnumbermatharithmeticinteger

Answer 2

Assume a standardized test has \$15\$ multiple choice questions, with \$3\$ options each. A school has some students and wishes for at least one of the students to get \$10\$ 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.

The problem is to find a number of students \$n\$ such that it is possible to do this and guarantee at least one of the students gets at least \$10\$ correct.

For example one way to do it is with \$n=3\cdot2^{15}-1\$ students, where we do all possible exams with at most two different options, since one of the options appears at most \$5\$ times we can get at least one test with \$10\$ correct solutions.

Another possible \$n\$ is \$a^5\$ where we can get a set of \$a\$ tuples of length \$3\$ that interesect every option of length \$3\$ at least twice ( so basically a solution to the problem with length \$3\$ and at least \$2\$ correct). It seems that the vectors \$(1,1,1),(2,2,2),(3,3,3)\$ along with the 6 permutations work, so \$9^5\$ is also a valid \$n\$.

The score will be \$\frac{1}{n}\$ where \$n\$ is a value for which it is possible to prove a configuration exists.

Answer 3

Gödel numbering of a string

Posted!

Answer 4

Compute the generalised XOR (posted)

Answer 5

Construct a Modulo Multiplication Table

Answer 6

Salvage My Chemistry Homework

Introduction

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, co could be cobalt or carbon monoxide. I want to know which of the formulas in my homework are ambiguous in this manner.

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.

Background

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, c, co and br2 are valid units (assuming that "c", "co" and "br" are in the list of symbols), while c0 and br2r are not valid units.

Input

The input consists of

• The list of elements (all letters are lowercase)
• A chemical formula with all letters in lowercase

Output

Output an integer, the number of ways there to separate the formula into individual units.

Test Cases

Input: ['c', 'o', 'co'], 'co2'
Output: 2 ('c o2', 'co2')

Input: ['c', 'h', 'o', 'ch', 'oh'], 'ch3cooh'
Output: 4 ('c h3 c o o h', 'c h3 c o oh', 'ch3 c o o h', 'ch3 c o oh')

Input: ['c'], 'c1'
Output: 0 (1 is not a valid subscript)

Input: ['a'], 'co2'
Output: 0 ("c" and "co" are not valid symbols)

Input: ['n', 'h', 'o', 'nh', 'no'], 'nh4no3'
Output: 4 ('n h4 n o3', 'n h4 no3', 'nh4 n o3', 'nh4 no3')

Standard loopholes apply. All reasonable input and output methods are allowed. This is code-golf, shortest code in each language wins.

Meta

• Would it be better to output each way to split the formula or just the number of ways?
• Any general wording improvements?
• Anything I should be more specific about?
• Suggested tags?
• Given that l4m2's question has now been posted, should I remove this? (While the challenge is similar, there are some significant differences).

Credit to l4m2 for original idea

Answer 7

Closest Binary Fraction

code-golf math rational-numbers

---

For this challenge, a binary fraction 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.

Input:

The first input will consist of a rational number. This can be represented by any of the following:

• A floating point number, or built-in rational type
• A fraction, either as a built-in rational or fraction type, or represented as a pair of numbers
• A decimal string, in any chosen base

The second input is an integer \$d \ge 1\$, representing the denominator of the binary fraction.

Output:

Output must 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.

You may choose if you want to simplify the output. Given the fraction 9 / 19 and the denominator 8, either 4 / 8 or 1 / 2 would be accepted.

Test cases:

Other:

This is code-golf. Unfinished and also a dupe of a newer challenge of mine

Answer 8

Is it a Fischer random chess starting board?

Answer 9

Task

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!

---

Given a non-empty string. If it contains "server" and "down" (capitalization doesn't matter), you infinitely output the >:( face with a newline after. If it doesn't, you only output "Hi" once, because you are busy and angry.

Examples

server down -> >:( (infinitely)
server -> Hi
down -> Hi
serverANDLETTERSAFTERTHEWORD down -> >:( (infinitely), as it contains both server and down
Why are your servers down? -> >:( (infinitely)
sErVeR dOwN -> >:( (infinitely)
serverDowN -> >:( (infinitely)
serverd0wn -> Hi

Rules

• This is code-golf, so the answer with shortest bytes wins.
• These loopholes are, obviously, forbidden.
• Standard code-golf rules apply.
• Please specify the language you are using and the amount of bytes.
• It would be great if you would put a link to a sandbox where your code can be ran in action, such as TIO.
• Explaining your code is very welcomed.

---

---

---

---

---

Please comment down below if this is good enough or not, or if it's a duplicate (hope not)

Answer 10

Ambiguous Chemical Formula

Answer 11

Dr. Lamport's Unfinished Business

Answer 12

Write a netquine

There are a lot of online interpreters, for a lot of languages. For example, there's the ubiquitous TIO, but there are also smaller, more specific ones that others have made, such as interpreters for Vyxal, ngn/k, or Grok.

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.

---

For example, say you write a Vyxal program λλλλ. In the Vyxal interpreter, if you press the button to generate a permalink for this program, you get:

http://lyxal.pythonanywhere.com?flags=&code=%CE%BB%CE%BB%CE%BB%CE%BB&inputs=&header=&footer=

However, due to the way that the interpreter processes links, you could also leave out the blank fields:

http://lyxal.pythonanywhere.com/?code=%CE%BB%CE%BB%CE%BB%CE%BB

You can even replace the HTML character codes with the actual characters:

http://lyxal.pythonanywhere.com/?code=λλλλ

All of these are valid links to the Vyxal program λλλλ, and therefore would all be valid outputs for a netquine.

---

• Obviously, Standard loopholes are forbidden.

• Even though URL shorteners are forbidden by default, shortening a URL, like in the example, is fine, as long as it still leads to the right place.

• For the purposes of this challenge, a web browser may be considered an "interpreter" for HTML and/or CSS. This means you might be able to do something along these lines.

• Usual code-golf rules apply, as do usual quine rules.

• This is code-golf, so the shortest answer in bytes wins!

code-golf quine internet self-referential

---

Meta

• Is this question clear enough?

• 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.)

• Any other feedback?

• This 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.

Answer 13

Encode USB packets code-golf binary coding-theory encoding

Posted

Answer 14

A Cat’s Game to Claim

Posted

Answer 15

Build a raw string

code-golf string

---

In this challenge you will write code which, given a single line string as input, can output the raw version.

Full spec

The input will be a string like ab\n or ab\u0065e\\ or e\'543. These strings should be converted to a raw version which uses the backslashes.

This probably sounds confusing, so here is a more complete explanation.

The most common form of strings used is simply a quote (one of ', " or the backtick), followed by a sequence of unicode characters, then a closing quote which corresponds the opening one. "abc" or 'THIS is a St%ing', for instance. Note that this is not the case in all languages, for instance most golfing languages do not represent strings in this manner.

However, it's not that simple. Backslashes allow for much more complex strings, and their importance in allowing certain characters means a string like 'ab\' is invalid as the backslash "escapes" the quote. Making a backslash appear in a string requires \\ instead.

Also, quotes can be escaped via \', \" or \`. A sequence like \\" should become \" while \"\ is invalid.

The newline and tab are both important, and so most mainstream languages have the \n and \t which are actually 1 character each, representing the newline and the tab, respectively. So \\t\"\n becomes

\t"

(note the trailing newline)

To add an extra layer of usability for "exotic" characters, it is possible to use a unicode escape: of the form \uxxxx where each x is one of 0123456789abcdef. This transforms into the unicode character whose codepoint is equal to the base-10 equivalent to the hexadecimal number xxxx. For instance \u0031 becomes 1 because 31 in hexadecimal is 49 in base 10, and 1 has a codepoint of 49.

Your input string may contain any of these escapes, and you may assume that \ is followed only by the backtick or any of \'"tnu. The unicode escape sequence is guaranteed to be valid, and escapes as well.

You should output this string after the transformations described.

Worked example

Input string:

ab%\u0035e\n\n\t5\'e\\54c%&\u0095

The first three characters remain identical.

\u0035 becomes 5 because 35 in hex -> 53 in base 10, and String.fromCharCode(53) === '5'.

\n\n\t becomes two newlines followed by a tab.

5 remains 5.

\' becomes ': escaped by backslash

e remains e.

\\ becomes \.

54c%& stays the same.

\u0095 is an unprintable with codepoint 149.

Result:

ab%5e

    5'e\54c%&<unprintable>

(<unprintable> is an actual unprintable character) Note that functions capable of evaluating such strings are disallowed. To be clear, your program must handle the syntax described above, and not any other format.

Other test cases:

Input	Output
\'\"	'"
\\"\'	\"'
\\u0031\u0031\\t	\u00311\t
\\\\\\\\\n	\\\\<NL>

[<NL> is newline]

---

Meta:

• Duplicate? Couldn't find anything.
• Any clarifications needed?
• Better title / tags?

Answer 16

COBOL(lite) interpreter.

Your task is to code an interpreter for COBOL. This interpreter should use the free format, and cut a few corners, as long as a few test scripts will run on it.

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.

Try to:

• Golf your code as much as possible
• Remove some parts of COBOL (But ask here first to see if they make sense to remove.
• Accept both CAPITAL and lowercase

Avoid:

• Standard Loopholes
• Don't remove too many parts of COBOL. I think that IDENTIFICATION DIVISION. could be ignored, but DATA DIVISION. is probably necessary.

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.

Answer 17

Implement a feature-rich calculator

code-golf math interactive

---

We have a few many calculator challenges on this site, but none seem to require a complex one with many different features.

This challenge is about emulating my old Casio calculator, except with no digit limit. Features are:

• basic (start with a single operation, then input the next operation)
• all clear (AC) which starts a new "calculation". No need for C.
• errors for dividing by zero (otherwise there should be no error)
• 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.

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).

Spec

Your solution should be able to handle floating-point numbers, hence float division should be used regardless of context.

When first run, the calculator will be "ON". It is guaranteed that input syntax is valid.

The chain of commands begins with a number operation number-like structure, where number can be replaced with MC to represent a reference to the memory. For instance 5 * 5 or 6/MC. Whitespace can be ignored or forbidden, that can be your call, but whatever it is you may assume syntax is valid.

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.

Subsequent operations can either be:

• M this sets the memory to current number. Memory can only ever hold a single number at a time.
• AC. Clears the current calculation and resets the number. Memory, however, will still be accessible.
• M-. (M minus) This clears the memory, and calls to MC will never be given when there is nothing in the memory.
• operation number where operation is + - * or /, and number is a number which can be replaced with MC.
• Off. The command Off stops the program, and it is reasonable to assume that no commands will be passed afterwards.
• - (minus sign) negates current number. Outputs the new number.

Division by zero should trigger an error and restart the calculation. AC, M, MC and M- should output nothing. Memory can be overwritten.

Note that operation number operation number will never be given, and that all operations will be performed on non-negative numbers. (we have the negate operator for negative numbers)

Also note that this challenge is less about parsing / processing a string input and more about responding to different kinds of input.

Example

As a full program, but note that a function will have to take in an array of commands. There is a > before each command, but in your version, it is not required.

> 5*5
25
> *4
100
> /200
0.5
> /0
ERROR (or some form of ERROR)
> 15*6
90
> M
> +MC
180
> AC
> 7-MC
-83
> -
83
> M-
> +5
88
> Off

---

Meta: is it a duplicate? any clarifications needed?

Answer 18

KotH - Floating Point Prisoners Dilemma

Answer 19

Encode a Lenguage

Answer 20

Outputting Blum Integers

Answer 21

What's missing

Answer 22

Do these points approximately make up a regular n-sided polygon?

code-golf geometry

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? n being the amount of coordinates provided. Answer truthy if yes, falsy if no.

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:

The triangle has points at approximately (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.

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.

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.

Further ground rules:

• The coordinates will always be positive.
• They do not have to be in any particular order.
• Coordinate values will never exceed 1000.
• There will not be more than 10 coordinates.

Examples:

(5,5), (4,9), (1,6) -> true
(3,1), (7,1), (8,5), (5,8), (2,5) -> true
(1,1), (1,1), (2,1) -> true
(1,1), (2,1), (130,1) -> false

(42,42) -> true

(according to Wikipedia, a monogon is still a polygon, meaning any input is valid.)

(0,1), (5,10) -> true 

(any two points make up a regular bigon so this should work for any coordinates)

(1,3), (1,3), (1,3), (1,3) -> true

(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).

Answer 23

Alteration of a challenge that was considered too close to an older quasi-duplicate.

ISO Computus

algorithm? code-golf? date

Your task is to calculate
from a signed integer year number provided as sole input
the integer number of the calendar week of Easter Sunday as sole output
with as few variables and as few arithmetic operations as possible.

Easter Sunday is determined according to the Gregorian Computus (as used in the all Western Christian churches, including the Catholic Church, and some others), for which there are several equivalent algorithms available, see Computus, Gent, Stockton and ESTRALGS.TXT. There are 35 possible month-day dates, from 22 March to 25 April.

The week of the year is specified by international standard ISO 8601-1: 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 Mathematics of the ISO 8601 Calendar. There are just six possible results, weeks 12 through 17. W17 will hardly ever occur – it has never occurred since 1583 at least.

Restrictions

• You may use all basic arithmetic operators, including addition, substraction, multiplication, division, integer division, modulo, rounding (with integer flooring and ceiling), exponentiation, logarithms.
• You may not use library functions that implement an algorithm for the Computus, like PHP's easter_date(), EasterSunday[year] from the Mathematica Calendar package or Easter from the R package timeDate.
• You may not use other predefined date functions, e.g. to find the day of the week or the week of the year.

Ranking score

Your solution must be an algorithm implemented as an executable script in a programming language of your choice.

• Each numeric variable and constant, whether used by name or literal value, counts as 1 point.
• Each basic operation, as defined above, counts as 1 point.
• Each definition of a custom function or method counts as 5 points.
• Each call of a custom function or method counts as 1 point.
• Imports and similar initializations required by the programming language are ignored.
• Neither reading the input value and returning or printing the output value nor eventual variables for storing their value are counted.
• The answer with the fewest points wins.
• TBD…

Example:

function CFAQEaster(year) { // Calendar FAQ
                       // 5 points for Div() function
  var G, C, H, I, J, L // 6 points for variables
  G = year % 19        // 2: 1 point for modulo, 1 point for 19
  C = Div(year,100)    // 2: 1 point for function call, 1 point for 100
  H = (C - Div(C,4) - Div(8*C+13,25) + 19*G + 15) % 30 
    // 16: 8 points for operations, 2 points for function calls, 6 points for additional numeric values
  I = H - Div(H,28)*(1 - Div(29,H+1)*Div(21-G,11)) 
    // 13: 5 points for operations, 3 points for function calls, 5 points for additional numeric values
  J = (year + Div(year,4) + I + 2 - C + Div(C,4)) % 7
    // 6 points for operations, 2 points for function calls, 2 points for additional numeric values
  L = I - J            // 1 point for substraction
  EasterMonth = 3 + Div(L+40,44) 
    // 6: 2 points for addition, 1 point for function call, 3 points for additional numeric values
  EasterDay = L + 28 - 31*Div(EasterMonth,4)
    // 6: 3 points for operations, 1 point for function call, 2 points for additional numeric values
  return {Y:year, M:EasterMonth, D:EasterDay} 
    // 63 points in total
}

Contemporary example input: output

• 2001: 15
• 2002: 13
• 2003: 16
• 2004: 15
• 2005: 12
• 2006: 15
• 2007: 14
• 2008: 12
• 2009: 15
• 2010: 13
• 2011: 16
• 2012: 14
• 2013: 13
• 2014: 16
• 2015: 14
• 2016: 12
• 2017: 15
• 2018: 13
• 2019: 16
• 2020: 15
• 2021: 13

The return value must 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 proleptic Gregorian Calendar applies.

Resources

• Wikipedia: Computus
• Wikipedia: ISO 8601 weeks
• R.H. van Gent: Easter calculation
• R.H. van Gent: ISO 8601 math
• J.R. Stockton: The date of Easter Sunday
• J.R. Stockton: estralgs.txt – collection of algorithms

Answer 24

Days of the Week

Answer 25

Generate the shortest regex to match these but not those

Answer 26

Solve Fermat's Last Theorem with matrices

Fermat's Last Theorem states that there is no such triple of positive integers \$(x, y, z)\$ such that

$$x^n + y^n = z^n$$

for all integers \$n > 2\$. However, this conjecture does not hold for integer matrices:

$$\begin{align} & \left( \begin{matrix} 1 & 3 \\ 0 & 1 \end{matrix} \right)^3 + \left( \begin{matrix} -1 & 0 \\ 1 & -1 \end{matrix} \right)^3 \\ = & \left( \begin{matrix} 1 & 9 \\ 0 & 1 \end{matrix} \right) + \left( \begin{matrix} -1 & 0 \\ 3 & -1 \end{matrix} \right) \\ = & \left( \begin{matrix} 0 & 9 \\ 3 & 0 \end{matrix} \right) \\ = & \left( \begin{matrix} 0 & 3 \\ 1 & 0 \end{matrix} \right)^3 \\ \end{align}$$

You are to take two \$k \times k\$ integer matrices \$A\$ and \$B\$, and a positive integer \$n \ge 2\$, and output a \$k \times k\$ integer matrix \$C\$ such that

$$A^n + B^n = C^n$$

You may output any such \$C\$. You may also take \$k\$ as an input, and you may assume that \$k \ge 2\$

This is code-golf, so the shortest code in bytes wins

Answer 27

Chess Squad March

Chess Squad March

Answer 28

I'm a lizard, cut here!

Answer 29

Do you come here often?

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.

How do we find the unique users behind the log ins?

Illustration: 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.

Challenge

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.).

Input: List_ID1, List_ID2

Output: List_ID3

Connection:

A user logs on and identify with two IDs, e.g. List_ID1[0] and List_ID2[0]. 
The first unique user is called "0" making List_ID3[0] = 0
- If List_ID1[1] or List_ID2[1] can be traced to user 1: List_ID3[1] = 0
- If List_ID1[1] or List_ID2[1] cannot be traced to user 1: List_ID3[1] = 1

Example Input and Output

Input:

[7, 7, 8, 9, 10, 11, 11, 10, 12, 12, 15, 16, 15, 16, 15, 16]
[1, 2, 2, 3, 3, 3, 4, 4, 5, 6, 2, 1, 2, 1, 2, 1]

Output:

[0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 0, 0, 0, 0, 0, 0]

---

Meta

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!

Answer the following questions for your readers: (From template)

1. Are there any corner cases? Is it clear how they should be handled?
   • I'm not sure.
2. How will the winner of the challenge will be determined?
   • 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?
3. Is it clear how all submissions will be scored?
   • I was thinking to make some test cases to run. Does that work?

Answer 30

King of the Hill: Nose Poker - An ogre game for ogres