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

Saboteurs in our Halls

This is a king-of-the-hill challenge, where one member on each team attempts to sabotage their team in secret.

Similar to Red vs. Blue - Pixel Team Battlebots, 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:

https://codegolf.stackexchange.com/users/[user-id]/[display-name]

For example, my user ID is 66833: https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing

If your ID is an even number, then you are on the Red team.
If your ID is an odd number, then you are on the Blue team.
There is no way to change teams.

As you cannot change your user ID, and to prevent one team flooding the field with bots, each user may only submit one bot

---

How the KotH will work

At the start of the game, each bot will be placed in a random cell in a \$1000\times1000\$ cell grid. No bot will be placed on the same cell as another bot, or within 5 cells of another bot. Additionally, \$999\$ random cells will be filled with 1 food. These cells may be any cell on the board that doesn't contain a bot.

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.

However, one bot will actually be a saboteur. 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.

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.

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.

---

The game is broken up into turns. 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 \$1\$ and \$9\$ inclusive, indicating which direction it would like to move in:

The bot is at \$5\$ before moving.

The bots for each team are called in a random order each turn, but none of them move until they all have returned values.

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 \$0\$ food.

If a bot moves into a cell containing an enemy bot, the two bots fight. The winner is determined by which bot has gathered the most food. The winner then "steals" 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 \$0\$ 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.

After \$10000\$ 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 \$100\$ 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 loses, the saboteur gains 2 points.

The team with the most total points of all its bots at the end of \$100\$ games wins.

How to answer

You should include in your answer 2 functions: move and sabotage. move is the function that will be called each turn when you aren't the saboteur and sabotage will be called each turn that you are the saboteur.

Both functions will receive the same arguments:

• x and y. The x and y coordinates of your bot, each an integer between \$0\$ (top-left corner) and \$999\$ (bottom-right corner).
• food. The current amount of food you are carrying. Initially 0, and changed by the controller for you when necessary.
• t_near. 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 x and y coordinates, the amount of food they're currently carrying, and the CGCC ID of their poster.
• e_near. 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 x and y coordinates, the amount of food they're currently carrying, and the CGCC ID of their poster.
• f_near. A list of coordinates of all food within a square, side length 33 cells, centered on you. Each food is represented by a pair [x, y] representing it's coordinates
• team_chat. A list of all chat messages sent between your team.

Messages

In order to allow inter-game cooperation, each team will have a "chat" ability. Each bot will be passed team_chat, 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).

For example, if a bot with a user ID of 1234 sent Hello, World! to the chat, the message would be 1234 Hello, World!.

Example Submission

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:

import random

def move(x, y, food, t_near, e_near, f_near, team_chat):
	return 5

def sabotage(x, y, food, t_near, e_near, f_near, team_chat):
	return random.randint(1, 9)

Rules

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

• You may only edit your answer within 12 hours of posting to prevent answers that continually optimise against new bots. You may not delete and repost your answer in order to try to circumvent this restriction
• Your code must not take longer than half a second (give or take a few milliseconds) to return its move
• 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.

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.

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.

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

---

Meta

• Is this clear enough?
• Is this a duplicate?
• 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?
• Tags are king-of-the-hill, game, grid. Suggestions?
• Any further feedback?

Answer 2

The Meeker numbers sequence

Answer 3

R.E.P.A.I.R. T.H.E. K.E.Y.B.O.A.R.D.

Answer 4

Make it prime with the smallest suffix

primes code-golf

---

Posted

Answer 5

Posted

Answer 6

Sr. 4Der says make this shape! (Episode 1)

Answer 7

Leave a wake of dead cells behind you

Answer 8

Quote a rational number

Answer 9

Sum over an Interval

Answer 10

Best Rolling Ao5

Answer 11

Is this number part of a Collatz prime sequence?

A fast step of the Collatz sequence is defined as

$$s_\mathrm{Collatz}:\mathbb{N}_\mathrm{odd}\to\mathbb{N},\quad n \mapsto \frac{3\cdot n+1}{2}.$$

Given an odd positive integer \$n\in\mathbb{N}_\mathrm{odd}\$, your task is to decide whether or not both \$n\$ and \$s_\mathrm{Collatz}(n)\$ are prime numbers.

Your program should output two distinct and unique values to represent truthiness and falseness, whereby falseness may also be represented by signalling an error.

Since \$n+\frac12(n+1)=n+\lceil\frac n2\rceil\$ for odd \$n\$, the sorted sequence of all numbers which result in truthiness in the above sense is equal to the tail of A158709.

Test cases

-8 -> -        ; undefined behavior
1  -> false    ; (3*1 +1)/2 = 4 is not prime
3  -> true     ; (3*3 +1)/2 = 5 is prime
5  -> false    ; (3*5 +1)/2 = 8 is not prime
7  -> true     ; (3*7 +1)/2 = 11 is prime
11 -> true     ; (3*11+1)/2 = 17 is prime
15 -> false    ; 15 is not prime
91 -> false    ; (3*91+1)/2 = 137 is prime, yet 91 is not
97 -> false    ; (3*97+1)/2 = 146 is not prime

Answer 12

Reject tab, return to linefeed

Answer 13

Solve the Alien Probe puzzle code-golf array-manipulation

Posted.

Answer 14

Drawing the Mathematics Stack Exchange logo (ASCII Logos 2)

The goal is to create the Mathematics Stack Exchange logo using ASCII characters.

It looks like this.

The exact output should look like this:

                   _
                /=/ \=\
             /=/       \=\
            |             |
            |\=\       /=/|
            |   \=\ /=/   |
            |      |      |
       _    |      |      |    _
    /=/ \=\  \=\   |   /=/  /=/ \=\
 /=/       \=\  \=\|/=/  /=/       \=\
|             |    |    |             |
|\=\       /=/|         |\=\       /=/|
|   \=\ /=/   |         |   \=\ /=/   |
|      |      |         |      |      |
|      |      |         |      |      |
 \=\   |   /=/           \=\   |   /=/
    \=\|/=/                 \=\|/=/
 /=/   |   \=\           /=/   |   \=\
|             |         |             |
|\=\       /=/|         |\=\       /=/|
|   \=\ /=/   |         |   \=\ /=/   |
|      |      |         |      |      |
|      |      |    _    |      |      |
 \=\   |   /=/  /=/ \=\  \=\   |   /=/
    \=\|/=/  /=/       \=\  \=\|/=/
       |    |             |    |
            |\=\       /=/|
            |   \=\ /=/   |
            |      |      |
            |      |      |
             \=\   |   /=/
                \=\|/=/
                   |

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.

Remember, 6 boxes aligned as a hexagon.

Can you draw it with the least bytes possible?

---

Tags: code-golf, ascii-art

Any suggestions?

If this question reaches a score of 4, it will be posted on 12:00 PM UTC, 1 month after Stack Overflow's.

Answer 15

KoTH - JS WarBots

king-of-the-hilljavascript

Based on King of the Hill: Robot Battle

Rules and Instructions

Program a bot as an object in JavaScript. The functions that can be called are:

• left(name) Moves left 1 unit (x position -1)
• right(name) Moves right 1 unit (x position +1)
• up(name) Moves up 1 unit (y position -1)
• down(name) Moves down 1 unit (y position +1)
• forward(name) Moves forward 1 unit (z position -1)
• backward(name) Moves backward 1 unit (z position +1)
• mine(name) Places a mine at current position (bots can be blown up by their own mines, with a 1 tick delay before priming)
• scan(name) Scans for mines and players in adjacent cells (cells a bot can move to). Returns an array [left, right, up, down, forward, backward]. Each element can be 0 (nothing there) 1 (mine) 2 (other bot).
• pass(name) Do nothing

name 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 "Foo" you must have pass("Foo") and not pass("foo") or pass("Bar"))

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.

A bot is eliminated from a game if:

• It is in the same position as a mine.
• It exits the game area.
• It collides with another bot (both bots are eliminated).
• The cell that it occupies does not have integer coordinates ((0,0,0) is valid, (0.5,0,0) is not)

Scoring

After 1000 turns, if a bot is not eliminated, it receives Math.floor(1000/bots) points, where bots 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.

Formatting your bots

Here are examples of bots (These will be playing too!):

RandomBot

var RandomBot = { // Same name as the name property
    name: "RandomBot",

    x: Math.floor(Math.random() * 1000 - 500), // If unspecified, defaults to 0.
    y: Math.floor(Math.random() * 1000 - 500), // If unspecified, defaults to 0.
    z: Math.floor(Math.random() * 1000 - 500), // If unspecified, defaults to 0.

    turn: () => {
        var action = Math.ceil(Math.random() * 9)
        if (action == 1) { left("RandomBot") }
        else if (action == 2) { right("RandomBot") }
        else if (action == 3) { up("RandomBot") }
        else if (action == 4) { down("RandomBot") }
        else if (action == 5) { forward("RandomBot") }
        else if (action == 6) { backward("RandomBot") }
        else if (action == 7) { mine("RandomBot") }
        else if (action == 8) { scan("RandomBot") }
        else { pass("RandomBot") }
    }
}

May the best bot win!

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.

Answer 16

xkcd 2385

Answer 17

How many Faro Shuffles for a cycle? code-golf array-manipulation card-games

Answer 18

Produce a range

Your task is to take a list of integers and find inputs to a Python range call to produce that list. That is, output three values (start, stop, step) so that range(start, stop, step) equals the given list.

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.

How range works

Python's built-in range produces a list* of equally-spaced numbers. Called as range(start, stop, step), it counts from the start value in increments of step like

[start, start + step, start + 2 * step, ...]

This list continues as long as the value is below stop given positive step, or above stop given negative step. If the start value already fails this test, an empty list is produced. Note that the stop value itself is never included in the list, giving a half-open interval.

range(0, 5, 1)   = [0, 1, 2, 3, 4]
range(0, -5, -1) = [0, -1, -2, -3, -4]
range(0, 2, -1)  = []
range(0, -2, 1)  = []
range(3, 4, 10)  = [3, 7]
range(3, 4, 11)  = [3, 7]
range(3, 4, 12)  = [3, 7, 11]
range(1, -2, 0)  = [1]

*In Python 3, it actually makes a range object, but we'll ignore that distinction.

Test cases

Note that there can be multiple valid inputs. Different stop values can cut off the result at the same point when the step is not ±1. A singleton or empty list can be produced in many ways.

TODO

Answer 19

Are You My Mother? (very WIP)

king-of-the-hill

---

(coincidentally, thought up around mother's day)

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.

Your task is to write two bot algorithms: one for the mother duck and another for the ducklings.

The game

There are 5 ducklings for each mother duck

All submissions compete at the same time

Finding your mother

All of the ducklings line up in a 1-dimensional array in the pond, as do the mother ducks. They do not move around.

Each turn, each duck (either duckling or mother duck) can do one of the following actions:

• Do nothing
• Quack
• Flutter its wings
• Splash
• Spin around
• Shake its head
• Put its head underwater
• some other action

Each duckling will see the actions of each mother duck on each turn

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.

Duck(ling) limitations

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.

Mother ducks have a bit more memory and can remember five integers between 0 and 15, inclusive.

Scoring

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.

Answer 20

Modify to Increment: Javascript Edition (WIP)

answer-chaining javascript

---

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

Coding restrictions

Your answer's code must be atomically irreducible, 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 characters 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 not allowed by virtue of this restriction.

Some tokens are not subject to this restriction:

• The declaration keywords let, var, and const
• Semicolons

Note that removing an operator between two tokens does not merge the tokens together into one token, so removing the + from 1+1 would result in 1 1 rather than 11

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

Multi-digit spelling

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. twenty three can be followed by twenty-four, and one hundred-thirty four is valid even though the spelling looks weird)

Should this challenge reach more than 100 answers, the expected format should be like one hundred thirty six rather than a hundred thirty six. You may optionally insert and between hundred and the next word.

Example

Answer 1

_=>'one'

Answer 2

_=>'twone'.substring(0, 3)

Answer 3

_=>'threewone'.substring(0, 3+2)

Answer 4

_=>'thfoureewone'.substring(02, 3+2+1)

Answer 5

_=>'thfoureewone'.replace('our', 'iv').substring(02, 3+2+1)

Rules and Scoring

• You may not comment out part or all of the previous answer.
  • 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 if(0)
• The case of the output does not matter (e.g. OnE is just as valid as oNE)
• 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.

The first answer to go 7 days (i.e. 168 hours) without a successor is the winner.

Answer 21

Just Enough Ones

Answer 22

An approximation for factorials of reals

One approximation for factorial function of reals is the following function:

\$ F_0(x) = \lfloor x \rfloor ! { \lceil x \rceil } ^ { x - \lfloor x \rfloor } \$

The function is less inaccurate for higher values of \$ x \$, meaning that you can get better approximations using the following recursive definition:

\$ F_{n+1}(x-1)=\frac1x{F_n(x)} \$

Examples:

\$ F_0(\frac72)=3!\times4^{1/2}=12 \$

\$ F_1(\frac52)=12/\frac72=\frac{24}7 \$

\$ F_2(\frac32)=\frac{24}7/\frac52=\frac{48}{35} \$

\$ F_3(\frac12)=\frac{48}{35}/\frac32=\frac{32}{35} \$

\$ F_4(-\frac12)=\frac{32}{35}/\frac12=\frac{64}{35} \$

Given non-negative integer \$n\$ and real (well, floating-point) \$x>-n\$, please calculate \$ F_n(x) \$.

This is code-golf, so the shortest program or function that breaks no standard loopholes wins!

Bonus brownie points for using your code to approximate \$ \lim_{n\to\infty}F_n(-\frac12) \$:

\$ F_1(-\frac12)=2 \$
\$ F_2(-\frac12)\approx1.89 \$
\$ F_3(-\frac12)\approx1.85 \$
\$ F_4(-\frac12)\approx1.83 \$
\$ F_5(-\frac12)\approx1.82 \$
\$ F_6(-\frac12)\approx1.81 \$
\$ F_7(-\frac12)\approx1.80 \$
\$ F_{10}(-\frac12)\approx1.79 \$
\$ F_{18}(-\frac12)\approx1.78 \$
\$ F_{88}(-\frac12)\approx1.77 \$

Answer 23

Optimal addition subtraction chain

Posted

Answer 24

Convert version string to pack_format code-golf

Posted

Answer 25

Telephone Cipher Encoder

code-golf

The telephone cipher is a relatively basic cipher originating from the book The Terrible Two. The cipher is explained here as follows:

Does this keypad (below) look familiar? It does? Good. You’ve seen a phone before.

Now, in the telephone cipher, there are two numbers for each letter. The first digit corresponds to the number on a telephone, while the second digit corresponds to the position on the key.

For example:

21 = A

Why? Because A is located on the number 2 on the keypad and A is in the first position of that particular key.

22 = B

B is located on the 2 key and is in the second position of that key.

53 = L

L is located on the 5 key and is in the third position on that key.

Given an input string s, the program should output the string encoded with the telephone cipher.

s may contain single spaces between words, but will not have leading or trailing whitespace and will use only lowercase letters a-z. s will always have a length greater than or equal to 1.

The output should contain no whitespace and be properly encoded with the telephone cipher as described above.

As an example, the following input:

hello world

Should result in:

42325353639163735331

All usual loopholes are disallowed. This is code golf so shortest answer in bytes wins. May the odds be ever in your favor!

Answer 26

Calculate \$ \lfloor n \log_2(n) \rfloor \$, exactly

code-golf math number integer

Given an integer \$ 2 \le n \$, you need to calculate \$ \lfloor n \log_2(n) \rfloor \$, assuming all integers in your language are unbounded.

However, you may not ignore floating-point errors - for example, in python lambda n:int(n*math.log2(n)) is an invalid solution, because for example for n=10**15, int(n*math.log2(n)) is 49828921423310432, while the actual answer is 49828921423310435.

Rules

• You can assume the input is an integer \$ 2 \le n \$
• You may use any reasonable I/O method
• Standard loopholes are disallowed

Test cases

2 -> 2
3 -> 4
4 -> 8
5 -> 11
6 -> 15
7 -> 19
8 -> 24
9 -> 28
10 -> 33
100 -> 664
1000 -> 9965
10000 -> 132877

10 brownie points for beating my 4 byte 05AB1E answer.

This is code golf, so the shortest answer wins. Good luck!

Answer 27

Symmetrical Triangles, posted

---

Meta Questions

• Dupe?
• More tags?
• Should I allow/disallow more output formats?
• Is "An equilateral triangle array" clear, or is there a way I can clarify it?
• Especially relevant test cases?
• Is there an easy way to take up less vertical space and still have a good amount of test cases?

Answer 28

Prime Factorization - but on the exponents too

Answer 29

Combinatorial Pipes

math combinations

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.

Goal

• Match the desired angle as closely as possible, with as few fittings as possible. It can be over or under the desired angle.
• Accuracy is more important than the number of fittings
• In the case of two different sets of fittings with the same resulting angle, whichever has the fewest number of fittings should be selected.
• If the two sets use different fittings, match the same angle, and have the same number of fittings, either may be chosen.

Input

Your input is a random integer between (non-inclusive) 0 and 180, which represents the desired angle.

Output

Your output should be an array where [0]-># of 8° fittings, [1]-># 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.

Test Cases

90° ->[0,0,0,0,1]
24°-> [3,0,0,0,0] ([0,0,1,0,0] uses less fittings, but is less accurate and therefore incorrect)
140°->[2,1,2,0,1]
140°->"2,1,2,0,1" acceptable if language does not support arrays

Scoring

Lowest byte count for each language wins a high five from me if we ever bump into each other (and the challenge).

Sandbox Questions

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.

Answer 30

Decode USB packets code-golf binary coding-theory encoding

Posted