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

Undecidable halting set

Write a program such that the set of natural numbers on which it halts is not recursive.

Shorter is better.

You may assume natural numbers in your language are unbounded.

Example: Python 3 (52 chars)

lambda n:eval(n.to_bytes(n.bit_length()//8+1,'big'))

Answer 2

Here is the problem, for which I can only think of an iterative solution and have not found a closed formula.

This problem was found on : https://www.codingame.com/ in the shortest codemode.

You need to paint a house with R rooms.

For each room there are four walls and one ceiling, which all have the same dimensions and need C coats of paint.

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.

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.

NOTE DON'T FORGET, THE PAINT MUST ALL BE DRY BEFORE YOU CAN RECEIVE YOUR PAYMENT!

In :

Line 1: R, C, M1, M2 separated by spaces.
R: Number of rooms in the house
C: Coats of paint needed for each wall/ceiling
M1: Minutes taken to paint each coat
M2: Minutes taken for paint to dry on each coat (measured from when you've finished the entire coat)

Out :

The time taken to paint the entire house in the format H:MM

Contraints

1 ≤ R ≤ 10
1 ≤ C ≤ 20
1 ≤ M1 ≤ 10000
1 ≤ M2 ≤ 10000

Dataset:

input: 1 1 12 0

output: 60

input: 5 2 5 30

output: 280

input: 1 5 5 200

output: 1045

Answer 3

Hello World! - Generation 3392

Your job is to create a genetic algorithm that slowly evolves and mutates its string until the output is equivalent to "Hello World!".

The genetic algorithm should start with a random string generated, and continue for generations, making random mutations to its code, like this:

Gen 3393 - Hemmo World!

To:

Gen 3394 - Hemko World!

Heres how the randomization algorithm works:

1. Create a function named randint(n), import the time module.

# Written in Python 3.8
import time # imports time
def randint(n): # create function

2. Get the current time since Jan 1. 1970, multiply by n and assign it as var "t". Make t an integer not a float.

t=int(time.time()*n) # Set time, and multiply by n.

3. Use the "%" operation on var "t" (var t is the first argument), with var n as the second argument, assign it as "rand". Code in python should look like this:

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.

4. Return rand.

return int(rand) #return results as integer.

Your program should have:

• A randomized start string (using the rand_int algorithm)
• A point it reaches "Hello World!"
• Mutation, using "parents". You are not allowed to completely change a string, only modify 1 character each generation.
• Mutations are not allowed to be repeated twice/No mutation backtracking.
• Once a genetic algorithm has a correct letter in its correct position (such as "e" in "reJ" and "Hes"). 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. So you cannot do this: ["Hlllr" -> "Hellr" -> "Hfllr"]

So I can do this:

Herlo Wcrld

Herlo Wrrld

But you cannot change >1 character/byte at a time:

Herto Wcrld

Heflo World

You can do whatever else you want with it if it satisfies those requirements.

Scoring:

This is code-golf, so the answer with the least amount of bytes wins.

Answer 4

Return all elements around an index forming sun

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.

External modules, like numpy, as allowed. The most efficient program wins.

Answer 5

Create a Screw

There are a variety of code cad 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.

The Challenge

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.

---

---

Changes

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.

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.

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.

Answer 6

Print your PPCG avatar

This is a graphical output question.

You have to connect to the codegolf.stackexchange.com in your homepage, scrape and download your avatar and show it in your default image viewer or some other way.

Standard loopholes apply, connections only allowed to codegolf.stackexchange.com

One language can be only used once, but a user can post multiple answers in different language

Tags: code-golf,graphical-output,internet

Answer 7

See who can write the longest code in order to print "Hello World!". The rule is that if you remove any single character from the code, it should NOT run.

Answer 8

Output function from one to another

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.

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:

1. It should function the same way as the original function. All things that function can do should be applied to the recreated one. For example, Python's print() has certain keywords like end.
2. Syntax doesn't matter. Example, if you can't use the << for cout, don't use it. Use what's available.
3. The function should be able to output the same errors like the original. Replicate the same errors from the original function. If impossible, leave it out.

An answer example would be making printf() from C using Python or making Console.WriteLine() (or just WriteLine() 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.

Answer 9

Random Roman Numerals

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.

Requirements:

• Each number has to have the same chance of appearing
• The program should use the language's random module or other random algorithm

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 the Wikipedia page.

This challenge is code-golf, so try to have the shortest program possible!

Answer 10

Is this an one-one function?

code-golf, math, set-theory, function

---

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

$$ \{1,2,3,4\} $$ $$ \{5,6,7,8,9\} $$

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 (1 -> 5, 2 -> 6, ......) is equal to the co-domain set, then it is a one-one function.

For the above example, the range set is

$$ \{5,6,7,8\} $$

So the range set is not equal to co-domain set, the function is not a one-one function.

Challenge

Inputted two domain and co-domain set of function, output a truthy value if the function is one-one or falsey if not.

Test cases

{1,2,3,4} {5,6,7,8,9} -> Falsey
{a,b,c} {b,c,d} -> Truthy
{4,8,2} {3,4} -> Falsey

Standard loopholes apply, code-golf, so shortest code wins

Pre-defining the input sets in the header section of TIO is not allowed.

Answer 11

Remaking Kernel code-golf

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.

Functions

It has 7 functions: 4 main (talk, count, calculate, build) and 3 advice functions (error, feedback, help).

What each function does:

• Talk asks for a prompt to the user and outputs the same thing.
• Count asks for a number to count from 1 to there. If the number is bigger than 50, it will lead to an error.
• Calculate asks for 2 numbers and an operator (must be either +, -, * or /) then will calculate the value. If the result is a number is greater or equal to 999999999, it leads to an error. However, 0 / 0 = 0 and other division rules still apply.
• Build 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 Error function.
  Disappointed that I can't make a proper pyramid.
• Error is a library that shows all 14 errors, which is listed in the Error page of this post.
• Feedback asks for feedback from the user and they can type whatever they want. The input will then be transferred in a new file called Feedback.list.

Inside Feedback.list:

• Help displays the info of the entire app.

Errors

There are 14 written errors to prevent writing the real errors.

1. NO_FUNCTION_ADDED: When asking for which function to use, entering a non-existent one will result to this error.
2. ERROR_CLASS_NONE: In Error, entering a number which doesn't have its error will pop this up.
3. COUNT_MAX: Well, typing a number greater than 50 won't put up the error, but counting up to 50 will.
4. INVALID_DIVIDE: Anything divided by 0 in Calculate (except 0 / 0) will put up this error.
5. ExTREME_VALUE: In Calculate, earning a final number of 999,999,999 or more will result to this error.
6. OVERSIZE_CHUNK: Entering a size larger than 20 in Build will result to this error.
7. UNKNOWN_STRUCTURE: Also in Build, inputting a structure unavailable will pop this up.
8. UNCLEAR_INSTRUCT: If the input for Build's line is not vertical, horizontal or diagonal, they wouldn't know what it is.
9. OVERWIDTH_COUNT: Building a tower with a width of 20 or more is invalid.
10. INVALID_PYRAMID: Similar to Build's line, inputting a pyramid unavailable pops this up.
11. OPERATE_BAD: Inputting an operator unavailable in Calculate is invalid.
12. MORE_NAMES: If you didn't know, to run Kernel, you need to add your name alongside running it. Me, I use ./Kernel MarkGiraffe. If I use Mark Giraffe instead, it is invalid.
13. SECRET_USER: Even NOT putting a name is not allowed.
14. BAD_ALIGNMENT: Not choosing left or right for a diagonal line in Build is invalid.

For this challenge, I want you to remake the program the most designed way, while still keeping low bytes.

In case you are interested, I will post the source code somewhere where you can view it.

Answer 12

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.

Answer 13

Poly-functional Polyglots

I don't have a ton of time to work on this, so I decided to remove it temporarily while I rework the scoring.

Answer 14

Generate a Printing Program In Some Language

Task

Given some rules:

1: Hello
2: World
4: Code
7: Golf
9: Whatever

Your program should output a program or a function (the output), which should be a valid program (or function) in some language. When the output is run, it should

1. Ask for some input (i),
2. Then output the string in the ith index in rules. (If there are none, don't output anything - even an error.)
3. Return to step 1.

Example:

Rules:

1: Hello
5: World
19: Code

One possible output (python):

while True:
  i = int(input())
  if i == 1:
    print("Hello")
  if i == 5:
    print("World")
  if i == 19:
    print("Code")

Scoring

Your score is the bytes in your answer (not the output).

---

Obviously this question should be clarified.

Answer 15

Given two reals \$a\$ and \$b\$, output some reals \$r_i\$, such that \$\sum r_i=a\$ and \$\prod\left(r_i+1\right)=b\$. You can assume that it's possible. You can also assume that your float type have infinite precision.

Test cases:

2,3 => 2 or etc.
2,4 => 1,1 or 1/2,(sqrt(57)+9)/12,(9-sqrt(57))/12 or etc.
2,5 => 1/3,1/2,2/3,1/2,0 or etc.
2,8 => sqrt(17)+2,2-sqrt(17),-2 or etc.
2,2 => sqrt(2)+1,1-sqrt(2) or etc.
e,2e => 1,e-1 or etc. (e is natural base, though any number>1 work)
-4,9 => -2,-2 or etc.
0,-1 => sqrt(2),-sqrt(2) or etc.

Shortest code wins.

Notes

• Though I only removed two positives from the existing question, it's a huge change to the result.
• I decide to keep the assume possible part just to make the note above correct. It can actually be proven that it's always possible.

Answer 16

Breaking BogoBogoSort (In Badness) code-golfmatharray-manipulationcombinatoricsrandom

The title says it all - make a sorting algorithm with a time complexity of \$O(n!^{n!})\$ 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, \$O(a^{b^n})\$, where \$a, b > 1\$.

Rules (since there must be some)

The list must be returned sorted in a finite time. This can be as high or as low as you want.

The algorithm must work for any real numbers (-30% if you can sort any single type given it's non-mixed).

The algorithm must work of any list length, and must eventually outpace ALL \$O(n!^{n!})\$ formulas, not just BogoBogoSort, and you must state the exact \$O\$ growth rate (for example, \$O(2^{3^n})\$). It may start off slow, but must eventually outpace all other expo-factorial functions (as I now name this growth rate).

Shortest code wins.

Answer 17

Get the Collatz Sequence

The Challenge

Write a full program or function that, when given an integer \$n \ge 0\$, outputs all steps of the Collatz Sequence (A006577) of \$n\$.

The Collatz Sequence

The Collatz Sequence is defined as: $$ a(n) = \begin{cases} n/2, & \text{if $n$ is even} \\ 3n+1, & \text{if $n$ is odd} \end{cases} \text{while n > 1} $$

Input

Input is some integer \$n \ge 0\$.

Output

Output is the sequence of numbers visited while calculating the Collatz Sequence, while the output is greater than 1.

Additional Rules

• Standard loopholes are forbidden.
• Input and output can be in any reasonable format.
• This is code-golf, so shortest code wins!

Test Cases

n -> sequence
0 -> [0]
1 -> [1]
2 -> [2, 1]
3 -> [3, 10, 5, 16, 8, 4, 2, 1]
4 -> [4, 2, 1]
5 -> [5, 16, 8, 4, 2, 1]
6 -> [6, 3, 10, 5, 16, 8, 4, 2, 1]
7 -> [7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1]
8 -> [8, 4, 2, 1]
9 -> [9, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1]
10 -> [10, 5, 16, 8, 4, 2, 1]
15 -> [15, 46, 23, 70, 35, 106, 53, 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1]
20 -> [20, 10, 5, 16, 8, 4, 2, 1]
25 -> [25, 76, 38, 19, 58, 29, 88, 44, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1]
30 -> [30, 15, 46, 23, 70, 35, 106, 53, 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1]
35 -> [35, 106, 53, 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1]
40 -> [40, 20, 10, 5, 16, 8, 4, 2, 1]
45 -> [45, 136, 68, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1]
100 -> [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]
9329 -> [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]
4637823 -> [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]

Tags: code-golfmathsequence

For Meta

• Is it clear?
• Any corrections?

Answer 18

Shortest common superstring

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.

Answers should be posted in the following format:

<Language name>, <Byte count>

<code>

This is code-golf, so the answer with the least bytes wins.

---

Any suggestions?

Answer 19

king-of-the-hill

Tac-Tok-Toe

Tac-Tok-Toe is just like tic-tac-toe, but instead of three in a row, the winning condition is three in a row but each letter is exactly one space apart horizontally, vertically, or diagonally. The win can also go in any direction.

The games

Each team (X and O) will make their own tac-tok-toe AI's. 10000 games will be played.

The moves

AI.PUT_TILE(board: List[List[str]], place: List[int])
    Places a tile at the specified location

AI.DECIDE_MOVE(board: List[List[str]])
    Decides and returns the index the AI wants to move depending on the current board situation.

AI.GET_WINNER(board: List[List[str]])
    Returns the winner of the board.

The board

The starting board looks like this:

 | | 
 | | 
 | | 

(Yes, I know, that indeed is a horrible tac-tok-toe board.) 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:

 | | 
 | | 
 | |X

An example of a completed grid could look like this:

X|X|O
O|X|X
O|O|X

We see that X has won, so the game should print: "X wins!"

Game files

[Your side]AI.py:

class [Your side]AI:  # Maybe change to something more meaningful?
    def PUT_TILE(board, place):
        pass
    def DECIDE_MOVE(board):
        pass
    def GET_WINNER(board):
        pass

startboard.txt:

 | | 
 | | 
 | | 

Meta

Any suggestions?

Answer 20

Randombility of number

The aim of golf is to calculate score of how random 10 inputs given by users were. The Criteria is given below.

• Points Rule
• 5+(1.1)^n If inputted numbers are not in Arithmetic OR Geometric progression for n cnsecutive terms
• 5+(1.1)^n if inputted numbers are not strictly increasing or decreasing for n>2
• 5*n if number is prime number > 100 here n is number of such terms
• -5-(1.1)^n if number is substring of $\pi$$ (3.1415926535897932384626433) for n>2
• 5 if difference between largest and smallest input is greater than 1000
• -5*n for n repeated inputs
• -5 + ln(log(p)) if number is square or cube of any number beetween -100 and 100 here p is number
• -5 if any three input ressemble any valid date (dd/mm/yyyy or mm/dd/yyyy) time(hh/mm or mm/hh) format
  • -Additional
• (1.5)^n if time interval between two inputs is less than 1.5 seconds

Improvements required Score system.

Answer 21

Secretary Problem - Cops and Robbers

Both threads

(Link to other thread)

The Secretary Problem is a famous problem. In this challenge, it’s a little different:

1. You need a new secretary that asks for the least salary
2. You have a lot of applicants that you can interview one at a time, but don’t know how many applicants there are
3. Each applicant will tell you how much salary they want (they’ll want at least $1 salary, but may all want $5)
4. Applicants do not ever request the same salary for some weird reason (not sure if they’re robots or eavesdroppers)
5. After you interview an applicant, you must give an immediate "yes, I accept you" (truthy) or "no, go away" (falsey)
6. You want the applicant that asks for the lowest salary, so you can stay rich
7. No applicant ever requests more than 1 million dollars (for obvious reasons)

_{In the maths world, it’s actually that you want the highest leveled applicant, but I put it this way because who doesn’t want to stay rich}

Cops Thread

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

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)

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)

If your answer does not accept any, (up to the last applicant) you automatically get

Robbers thread

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

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)

Put a link cop answer you are attempting to make go broke in your answer.

You must have at least 100 applicants (with at least one applicant that requests <$100)

Both threads (again)

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)

Sandbox questions

• Is this too far-fetched?

Somewhat shamelessly stolen Derived from this question

cops-and-and-robbers

Answer 22

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

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.

Examples:

• Range: 100 - 200
• Divisors: 3, 5
• Non-divisors: 9, 10

Possible values are: 105, 165, 195 (output one at random)

Rules

1. Mathematically elegant solutions are preferred, but brute force solutions are accepted.
2. 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.
3. This is code golf, so lowest byte count wins.

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

Answer 23

Quantum boolean

code-golf boolean

Background

Have you ever dream of quantum state? If that's true for you, you are probably weird...

Anyway, I came up with an idea: what if we make a quantum in code?

Task

Create a data type, function, or class, anything that can be put in a condition.

What should it do:

(def your thing here, I'll name it "X" for now)


if X:
  part a
else:
  part b

part a and b should both be executed, although the chance of which being first should be 50/50.

if X:
  a=5
else:
  a=10
  b=5

a should have 50% chance to be 5, 50% 10, but b will always be 5

x can be different everytime mention, or always the same on parallel universe

if X:
  part a
else if X:
  part b
else:
  part c

Could be:

execute a,b,c with a 50% being first execute,b,c 25% each.(second X and first X both being quantum)

In this case a will never be the second one executed.

possible case:

a,b,c
a,c,b
b,c,a
c,b,a

     / a True 50%
init           / b True 25%
     \ a False 
               \ b False - c 25%
     First X     Second X

Or:

X True for a

X False for c

b will never be executed.

     / X True - a
init 
     \ X False - c

Example

X as your submit

if X: # or X()
  print(1)
else:
  print(2)

return

1
2

or

2
1

Extra

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

Rule

• Standard rules.

Goal

golf your quantum as smaller as possible!

Meta

• Is this clear?
• Is this hard?
• Is this fun?

Answer 24

code-golf

Silly Sentence Generator

Your challenge is to input a sentence and find all words enclosed within angle brackets. (< and >)

Here is an example:

The <adjective> <noun> biked across the bridge.

Next, replace all <noun>s with a random noun, all <verb>s with a random verb, all <adjectives>s with a random adjective, and all <adverb>s with a random adverb.

According to the above rule, The <adjective> <noun> biked across the bridge. could become The daring monkey biked across the bridge.

Your program will input a list of nouns, verbs, adjectives, and adverbs.

Make sure the words follow capitalization. So if the random noun in <noun> <verb>ed is monkey, it should then become Monkey. Another rule is that if a verb (like slide) ends with e, and the bit after the <verb> is ing or s, (e. g <verb>ing) do not keep the final e. (e. g slideing becomes sliding).

Examples

Note that these examples assume the nouns are monkey and ai, the verbs jumped and sliding, the adjective daring, and any list of adverbs (since the examples don't use them.)

The <noun> was <verb>ed by the <adjective> <noun>. => The monkey was jumped by the daring ai.

<verb>ing <noun>s play together. => Sliding monkeys play together.

Shortest code wins!

Answer 25

Output sequence from a name

You are given a sequence of numbers(0-9) which you have to convert to its literal form.

Example

Input : 1246
Output : 26666

We interpret the input as one 2 four 6, thus giving the output 2 one time and 6 four times

Testcase

Input	Output
1234567809	2444666668888888
2345	335555

P.S.

1. Is this descriptive enough?
2. Would it be fun to do?

Answer 26

Can I obtain this Minecraft item?

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.

Actions

This is a list of all actions which may be performed, and what items they involve

Crafting:

• Log × 1 to Planks × 4
• Planks × 2 to Stick × 4
• Dirt × 2, Gravel × 2 to Coarse Dirt × 4
• Glass × 6 to Glass Pane × 16

Mining:

The following require a wood pickaxe, or above:

• Stone × 1 to Cobblestone × 1
• Coal Ore × 1 to Coal × 1

The following require an iron pickaxe, or above:

• Diamond Ore × 1 to Diamond × 1
• Emerald Ore × 1 to Emerald × 1

The following do not require a tool:

• Coarse Dirt × 1 to Dirt × 1
• Gravel × 1 to Flint × 1

Smelting:

Smelting requires fuel, see below. These are the items that can be smelted:

• Cobblestone × 1 to Stone × 1
• Sand × 1 to Glass × 1
• Coal Ore × 1 to Coal × 1
• Iron Ore × 1 to Iron Ingot × 1
• Diamond Ore × 1 to Diamond × 1
• Emerald Ore × 1 to Emerald × 1
• Kelp × 1 to Dried Kelp × 1

(unfinished)

Answer 27

Biggest 25 byte number

You are allowed 25 bytes of source code.

With these you have to calculate the biggest finite number possible, assuming infinite number precision^[1], runtime and memory.

You will not be taking input and do not have to output the final result.

You are not allowed to use a String representation, so "9".repeat(BIG_NUMBER) is disallowed.

Scoring will be based of the final number, bigger numbers ranking higher.

[1]: This means that for example in java you do not need to use BigInteger to represent big numbers, but using an int would be sufficient. Over- and underflows are ignored as if the int had infinite precision.

Answer 28

[1], [2], [1, 1], [3, 2] Sequence

Challenge:

The sequence starts with [1]

And multiply by the reversed indices plus one.

And make an extra list containing 0 length of the list times.

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

Then the next list will be the list plus an extra list.

Example (step-by-step)

RETURN [1]
[1]
[2] [0]
[2] [0]
RETURN [2]
[2]
[4] [0]
[1] [1, 0]
RETURN  [1, 1]
[1, 1]
[3, 2] [0, 0]
[3, 2] [0, 0]
RETURN [3, 2]

Test cases

TODO

Meta:

• Suggestions?

• Which test cases I should add?

Answer 29

Mahjong Checker

Answer 30

Zhiwei Sun Squares

Given a positive integer n, find the number of ordered tuples (a, b, c, d, e) over non-negative integers for which a² + b² + c² + d² = n and b + 3c + 5d = e².

Note: A conjecture by 孙智伟 (Sūn, Zhìwěi) states that this count is always at least 1.

For example, if n is 9, there are 3 solutions, namely:

(0, 0, 3, 0, 3)
(1, 0, 2, 2, 4)
(3, 0, 0, 0, 0)

Test cases:

9 -> 3
4 -> 2
24 -> 1
25 -> 5
144 -> 3
128 -> 1
365 -> 9
366 -> 21

Scoring:

This is code-golf, so shortest code wins!

Credits to this puzzle