# What is the Sandbox?

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

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

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

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

# Introduction

SANDBOX NOTE: Diagrams soon

Copolar: Two triangles ABC and A'B'C' (not necessarily in the same plane) are said to be copolar if and only if the lines AA', BB', and CC' are concurrent at one point V.

Coaxial: Supoose two triangles ABC and A'B'C' are defined such that AB and A'B' intersect at X, AC and A'C' intersect at Y, and BC and B'C' intersect at Z. Then, the two triangles ABC and A'B'C' are said to be Coaxial if and only if X, Y, and Z are collinear.

Desargue's Theorem: Copolar triangles are coaxial, and conversely.

# The Challenge

Your challenge is to write two entire programs (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 V, and the other must check the collinearity of X, Y, and Z (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 Levenshtein distance between the two programs, with lowest score being dubbed winner.

# Input

You will receive 6 vectors, all of which containing an x, y, and z floating-point Cartesian coordinate, to represent the vertices of ABC and A'B'C'. This information may be received by your program in any convenient format, including command line arguments, nested lists, etc. The two programs you submit should take input in the same manner.

# Output

Your program should print a truthy value if ABC and A'B'C' are coaxial/copolar, and a falsey value otherwise. As this will likely require floating-point calculations, we establish some leniency:

Choose a constant value 0 < ERR < 0.01, for use in both programs.

• If the pairwise intersections of AA', BB', and CC' intersect within ERR units of one another, the given triangles should be considered copolar.

• If the point Z lies closer than ERR distance from the line XY, the given triangles should be considered coaxial.

Standard techniques for checking floating point calculation equality should be sufficiently accurate for this challenge.

Since copolar triangles are also coaxial, the programs should output the same value in all but extreme cases.

It should be assumed that any cross section of the cartesian space provided is an Extended Euclidean Plane. Note that it is possible that the vertex V or any of X, Y, and Z may be an ideal point, and this is a case that should be prepared for.

# Test cases

SANDBOX NOTE: Coming soon...

• Levenshtein distance between two programs has been tried before and is now well-known to be completely useless as a winning criterion. Anyone with half a brain can score 1, and sometimes it's even possible to vary the input enough to detect the cases and score 0. – Peter Taylor Jan 11 '16 at 11:09

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!

## Input

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

## Output

For each case, display the minimum total weight difference.

5 6 8 5 2 6

2 25 62

# Sample Output

1

37

I asked this earlier and it was put on hold. Not sure what needs to be changed.

• First you need a winning criterion. Code golf (shortest valid code wins) would work well here. Another possibility would be fastest code, but that would be harder to judge - you'd probably need to run every answer on your machine, in a number of different languages. Popularity contest is hard to write a good question for, and is best saved for questions where there is no other way of judging. If you don't have a strong preference, I'd go with code golf. – trichoplax Jan 11 '16 at 3:37
• An edge case to consider: Will the input ever be just 0 followed by no cookies? Whichever way you decide, it's worth mentioning this explicitly in the question so people know whether to plan for that. – trichoplax Jan 11 '16 at 3:42
• You had asked for the total weight of cookies to be minimized, which I suspect was not what you intended, so I've edited it to ask instead for the difference in total weight to be minimized. If this wasn't what you intended feel free to roll back the edit. – trichoplax Jan 11 '16 at 3:47
• That clears it up a lot, thank-you, @trichoplax – Tanner Jan 11 '16 at 3:54
• You're welcome. You'll still need to do some further editing to address my first 2 comments, then after that hopefully others will comment with anything else that needs improving that I've missed. – trichoplax Jan 11 '16 at 4:50
• This is a trivial variant of this older question and IMO close enough to count as a dupe. – Peter Taylor Jan 11 '16 at 11:07
• I believe the question was closed as a duplicate of this because it's exactly the same, just about cookies instead of shopping bags. – user81655 Jan 15 '16 at 10:54

# Count the ones!(better title needed)

[Sandbox-note: Is this really still code-golf?]

[Sandbox note: Need to find descriptive tags]

Void Corp needs you!

Thanks to extreme advancements in a technology called null-space 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.

Your code should contain as few 1-bits as possible when stored in null-space.

We have heard of this strange Unary. As our programmer is the only one able to understand it, we are currently not able to implement it.

Write a program that counts all 1-bits in a given string.

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.

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 NUL (unless I missed it). [Sandbox note: Don't tell me there is such a thing.]

# Scoring

Count the 1-bits in your code. Fewest amount wins.

[Sandbox note: Should add script to paste code into for evaluation]

## Sandbox Questions

What do you think of the task? It seems pretty basic to me, the twist is the Scoring.

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?

Does someone happen to have a script for evaluation lying around? Do you have anything to add?

Is appropriate for this question?

• IMO this is a variant of codegolf.stackexchange.com/q/4434/194 and the twist isn't particularly twisty. I would vote to close as dupe. – Peter Taylor Jan 11 '16 at 14:08
• Also the tag you would want, just fyi, is code-challenge. – FryAmTheEggman Jan 11 '16 at 15:49
• – lirtosiast Jan 20 '16 at 18:41
• @ThomasKwa Indeed... – JFBM Jan 20 '16 at 19:26

# Fixed Width

We like fixed width. We want you to evaluate a string
on it's "fixed width"-ness. However, this string will
not be a regular string. This input will be presented
to your code as thus: "name1, name2, lin1,..., linN".

Each of linK is a single line of a transcript; you'll
assume that the speakers alternate, and that each lin
is will not have trailing whitespace, like this:


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.

Say your input is rob, emily, hi, hey you, last night was nice, the best i've had. Then, the result would be:

<rob> hi
<emily> hey you
<rob> last night was nice


Then, this input would have a "fixed width"-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.

## Test cases

input => output

rob, emily, hi, hey you, last night was nice, the best i've had => 2
a, b, hello, hola!, no, what?, why, why not, abcdef, fededa, 012345 => 3


I think this should be , but I think this could also work as a fixed-width , maybe.

# Hexotria number

Inspired by Triangular Ulam spiral

For instance we write number in triagular spiralling way

      30  10  26  51
31  11  09  25  50
32  12  01  08  24  49
33  13  02  00  07  23  48
14  03  04  05  06  22
16  17  18  19  20
39  40  41  42


Then we read in spiralling hexagonal way (Starting from 0, 1 ,2) then we get

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


Your challenge is given a number (i) output the i'th item in that sequence. i is zero based. Shortest code wins.

• meta.codegolf.stackexchange.com/a/8048/8478 – Martin Ender Jan 15 '16 at 15:00
• Otherwise, this sounds like a nice challenge :). You should specify whether i is 0-based or 1-based or whether people can choose. – Martin Ender Jan 15 '16 at 15:01
• @MartinBüttner Now, what's missing in this challenge? – Xwtek Jan 17 '16 at 0:26

# The quitting log-in

This program relies on the user pressing Ctrl + C at specified times to show him the secret message (the secret message is just m to avoid polluting the byte count with un-avoidable chars).

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) ? each time.

The user should press Enter to get to the next question.

If the user does not press <Control-C>, nine successive prompts should be shown.

Given a code 523

?
?
?
?
? <Control-C>
?
? <Control-C>
?
?
? <Control-C>
m


Given a code 123

?
?
? <Control-C>
? <Control-C>
? <Control-C>

• Instead of m you could make the program output something truthy or falsy depending on whether the pattern is correct. Also do you want to specifically make this a challenge about catching process signals? Because that will rule out a lot of languages, and if it's not your intention you could also have the user enter a specific string instead of having them send Ctrl+C. – Martin Ender Jan 19 '16 at 20:02
• @MartinBüttner I actually want to make this a challange about handling KeyboardInterrupt because I have never seen it in a code-golf challange, as far as m vs truthy falsy is concerned, it is just a matter of r?'m':'' now, and the message may in theory be a long string, one char just to avoid cluttering the code up – Caridorc Jan 19 '16 at 20:35
• There's at least codegolf.stackexchange.com/q/63105/8478 but I feel like we've had another one, too. – Martin Ender Jan 19 '16 at 20:52

# Queuing queues

I recently found a great site, Dubtrack, for all my music needs. However, it features a very interesting method of ordering, which contains a queue of users, and each user has their own personal queue.

The user queue loops through each of the users that have songs, and plays the top song from their individual queue. This means that:

1. When there is a single user, it simply plays the songs in the order that user added them.
2. When there are multiple users, it interleaves the songs.

However, users' queues aren't always filled, and when a user adds his first song to the queue, the user is added to the end of the user queue.

For example, say there were 3 users each with the following queues (at time 0):

0 [1,10,100,1000]
0 [2,20]
0 [3,30,300]


then the resulting playlist would look like:

[1, 2, 3, 10, 20, 30, 100, 300, 1000]


However, if a user were to add his queue during the 4th song:

0 [1,10,100,1000]
0 [2,20]
0 [3,30,300]
3 [4,40,400,4000]


Then the playlist would look like

                      v New user's song finally plays
[1, 2, 3, 10, 20, 30, 4, 100, 300, 400, 1000, 400, 4000]
^ New user added here, but user 2 and 3 are still in front


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 0, and that additional users won't be added after all the songs have played.

# Test cases

Input
0 [1,5,3,7,2,6,3]
Output
[1,5,3,7,2,6,3]

Input
1 [3,6,9,12]
0 [4,10]
Output
[4,10,3,6,9,12]

Input
0 [1,10,100,1000]
0 [2,20]
0 [3,30,300]
3 [4,40,400,4000]
Output
[1,2,3,10,20,30,4,100,300,400,1000,400,4000]

Input
11 [3000]
3 [6,8,10,11,0]
5 [4,100,14,12,0]
0 [0,1,2,3,4,5]
11 [2000]
Output
[0,1,2,3,6,4,8,4,5,10,100,11,14,3000,2000,0,12,0]

• I'm not sure I understand how the queue system works. You say "when a user adds his first song to the queue, the song is placed at the end of the interleaving process", but in the second example, song 4 is placed before song 21, not at the end of the existing queue. Maybe I'm misunderstanding what you mean by "a queue". – Zgarb Jan 20 '16 at 19:43
• @Zgarb I made a few changes: There is a queue of "users" and each user has their own individual queue. I've also termed the output as a "playlist". Do you understand now? – Nathan Merrill Jan 20 '16 at 20:07
• It's much better now, yes. But just to be clear, when a song is popped from a user's personal queue to be played, that user is effectively sent to the bottom of the user queue, right? – Zgarb Jan 20 '16 at 20:16
• Yep, that's how it works. – Nathan Merrill Jan 20 '16 at 20:17
• What assumptions can be made about the song IDs? Are they guaranteed to be non-negative integers between e.g. 0 (inclusive) and 2^31 (exclusive)? Can answers choose between that or strings? Something else? – Peter Taylor Jan 23 '16 at 19:04
• Both of those sound like good options. – Nathan Merrill Jan 23 '16 at 19:42

# Natural Language Calculator

Background

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!

Challenge

The input will be a string, obviously. For multiple operations, there will be commands within input of commands.

Pi and e are simply inputted as "pi" and "e". Other special numbers are not needed to be handled.

Parse the following commands:

• Subtract x and y
• Multiply x and y
• Divide x and y
• Factorial of x
• x factorial
• Exponent base n of x
• Log base n of x
• Natural log of x

You must deal with it case-insensitively. For example "5 Factorial" gives the same result ad "5 factorial" or "5 FAcTorial".

Testcases

> "Add 4 and 5"
9
> "Multiply 6 and 10"
60
> "Divide 144 and 12"
12
> Exponent base 10 of 3
1000
> 3 factorial
6
> 3
> Add 5 factorial and 2
122
> Exponent base e of natural log of e
e
> natural log of e
1

• -1 Unclear challenge. – Xwtek Jan 16 '16 at 9:11
• @ChristianIrwan "Still in the works and need to add more detail" – TanMath Jan 16 '16 at 9:32
• Well, I think the sandbox is not for brainwashing idea, but to polish the challenge while detecting it if the challenge is duplicate. – Xwtek Jan 16 '16 at 13:57
• The sad thing is, most of these are actually things in AppleScript already. Shame that there's no eval for i- oh, wait, there's a library for that in Java. – Addison Crump Jan 22 '16 at 23:13
• Even if this were cleaned up, I don't see what it adds to the many existing "process arithmetic in english" challenges. – xnor Jan 22 '16 at 23:36

## Semaphore Decoder

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 o (which is always in the upper middle square), and his flags represented by _ | / \. 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:

[Space]  o   A  o  B _o  C \o  D |o  E o/  F o_  G o   H _o  I \o  J |o_
| |    /|     |     |     |    |     |     |\    /      /

K  o|  L  o/  M  o_  N  o   O _o\  P _o|  Q _o/  R _o_  S _o   T \o|
/      /      /      / \                                  \

U \o/   V |o   W /o_  X o/  Y \o_  Z o_
\           \             \


To keep your messages from being observed by spies, your code must be as short as possible.

Example:

Input

_o| _o_ _o\  o   o   o_  o_ \o   o   o   o  _o| \o/  o_  o_  o/  o/ _o   o
|\ /|  /   /    /  / \  |\ | |           \   \ /    |    \ | |
o   o  |o   o  \o  _o\ |o   o/  o   o   o/ _o\  o/  o_
/|  / \  |  | |  |       |   |  | |  |\ /       /    |


Output

PROGRAMMING PUZZLES AND CODE GOLF

• Essentially the opposite of this encoder -- codegolf.stackexchange.com/q/3628/42963 – AdmBorkBork Jan 25 '16 at 21:06
• @TimmyD - I saw that. In fact I deliberately chose a different format (3x2 instead of 3x3) so that you couldn't just use the same code in reverse. I think the bonuses will also make this a bit more interesting, since some signals have multiple meanings, and you need to keep a stack to handle the Error code. – Darrel Hoffman Jan 25 '16 at 21:14
• -1 for bonuses – Mego Jan 26 '16 at 8:42
• @Mego - Is it the idea of bonuses that offends you? Or is the scoring just not balanced? I think the bonuses are what make this challenge the most interesting. Would it help if I were to make them requirements instead? – Darrel Hoffman Jan 26 '16 at 14:35
• @DarrelHoffman The linked post explains fairly well why I am strongly against bonuses. The biggest issue I have is that n bonuses require people to solve the problem 2^n different ways, and look for the best score. The bonuses add unneede complexity, and detract from the actual challenge. – Mego Jan 26 '16 at 20:31
• If you think the bonuses make it more interesting, make them requirements. – Peter Taylor Jan 26 '16 at 21:37
• What I don't get is - I've seen dozens of challenges that had one or more bonuses, and I've never seen a complaint about them until now. I guess I could see how it affects some languages more than others, but it's not like there's actual prize-money going out for these things. It's more just a matter of having fun and practicing code-fu. I'm just afraid that having those bonuses as a requirement might scare off some people from even trying. But without them - is this even much of a challenge for the veterans out there? – Darrel Hoffman Jan 26 '16 at 21:56
• @DarrelHoffman Bonuses on challenges used to be rarer. Then people started putting bonuses on everything, with severely detracted from challenge quality. So, in response, the community decided (in the post I linked) that bonuses shouldn't be used unless you have a really strong justification for including them. 9 times out of 10, the challenge would be vastly improved by making them requirements or discarding them outright. – Mego Jan 27 '16 at 1:53

# How many swaps do I need to sort a list?

A swap is defined as an operation on a list that exchanges the position of exactly two elements:

[9, 1, 3, 4, 0, 0, 3, 7, 9, 1, 4, 4, 8, 7, 3, 9, 4, 7, 0, 1]
| <----------------> |
[9, 1, 1, 4, 0, 0, 3, 7, 9, 3, 4, 4, 8, 7, 3, 9, 4, 7, 0, 1]


Of course, every list can be sorted via some sequence of swaps (e.g. that's how Shell sort works).

Given a list of single-digit integers, determine the minimum number of swaps you need to sort the list.

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.

Input may be in any convenient, flat list format, as long as the data is not preprocessed.

Standard rules apply.

(will follow)

### Sandbox Questions

• 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?
• Bubble sort only swaps adjacent pairs and that's much easier to calculate (at least for distinct elements) - all you need do is to consider each distinct pair of elements and count how many pairs are out of order. – Neil Jan 29 '16 at 8:37
• @Neil Of course. But if you can sort a list via swaps of adjacent elements, you can also sort it via swaps of arbitrary elements. – Martin Ender Jan 29 '16 at 8:42
• I just didn't think it was the best, um, sort of sort to use to demonstrate the idea. – Neil Jan 29 '16 at 8:49
• @Neil fixed? :) – Martin Ender Jan 29 '16 at 9:11
• Now that's what I call an excellent sort of sort to demonstrate the idea! – Neil Jan 29 '16 at 13:42
• Oddly enough I was thinking of a challenge very much like this. – J Atkin Jan 29 '16 at 14:48

## Employee Scheduler

This challenge is simple: make a schedule for the student workers in my department!

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.

### Required Minimums:

Your program should at least be able to do the following:

1. Input a list of first names and times of availability
2. Output a one month schedule that covers 4 stations 5 days a week from 800 to 1700

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 "NEEDED" or something like that. Note that the times of availability will depend on the day of the week.

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.

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

### Other Notes:

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.

Some things that I'm not requiring, but would definitely earn some kudos from me:

• Use a station priority system when creating the schedule (some stations should be covered before others)
• Try to maximize the hours given to each student (while not going over 20 hours per week, of course)
• Minimize overlap
• Make your output pretty (currently we use an excel spreadsheet that looks pretty nice)
• Input the number of stations
• Input the month for which to generate
• Generate multiple months (using the same availability)
• Input holidays and days the department is closed
• Make your program run on both Windows and OS X

### Examples

INPUT:

Jack    m:0900-1530 t:0800-1530 w:0900-1200 th:0800-1530 f:0900-1700
John    m:0000-0000 t:1300-1700 w:0900-1200 th:1300-1700 f:1000-1200
Joseph  m:0800-1000 t:1300-1700 w:0000-0000 th:1300-1700 f:0800-1000
Jannett m:1430-1700 t:0000-0000 w:1200-1700 th:1100-1400 f:1200-1700
Brianna m:0900-1430 t:0800-1300 w:0900-1430 th:0000-0000 f:1200-1700
Dianne  m:0800-0900 t:1300-1700 w:0000-0000 th:1300-1700 f:0800-1000
Megan   m:1400-1545 t:1100-1700 w:1400-1545 th:1100-1700 f:0000-0000
Sierra  m:1600-1700 t:0800-1100 w:0900-1300 th:0000-0000 f:0800-1300
Sandy   m:1345-1700 t:0800-1045 w:1345-1700 th:0800-1045 f:1200-1700
Holly   m:0800-1200 t:0800-1200 w:0000-0000 th:0800-1200 f:0800-1200


OUTPUT:

Monday              Tuesday          Wednesday        Thursday        Friday

STA 1               STA 1            STA 1            STA 1           STA 1
Joseph 8-10         Holly 8-1130     Brianna 9-1430   Jack 8-11       Joseph 8-10
Jack 10-1430        Brianna 1130-13  Jannett 1430-17  Megan 11-17     Holly 10-12
Jannett 1430-1700   Joseph 13-17                                      Desiree 12-17

STA 2               STA 2            STA 2            STA 2           STA 2
Riane 8-9           Sierra 8-11      John 9-12        Holly 8-11      Sierra 8-1
Brianna 9-1430      Megan 11-17      NEEDED 12-1430   Jannett 11-2    Brianna 13-17
Megan 1430-1545                      Megan 1430-1545  Joseph 14-17
NEEDED 1545-16                       NEEDED 1545-17
Sierra 16-17

STA 3               STA 3            STA 3            STA 3           STA 3
Holly 8-12          Sierra 8-1045    Holly 8-12       Sierra 8-1045   Riane 8-10
NEEDED 12-1345      NEEDED 11-13     Sierra 12-1      Jack 11-1       Tyler 10-12
Sandy 1345-17       Riane 13-17      NEEDED 13-1345   Riane 13-17     Sandy 12-17
Sandy 1345-17

STA 4               STA 4            STA 4            STA 4           STA 4
NEEDED 8-9          NEEDED 8-13      NEEDED 8-9       NEEDED 8-13     NEEDED 8-9
Jack 9-10           John 13-17       Jack 9-12        John 13-17      Jack 9-14
NEEDED 10-1430                       NEEDED 12-17                     NEEDED 14-17
Jack 1430-1530
NEEDED 1530-17


As you can see, in this case the input 0000-0000 means that person is not available on that day of the week.

# Monophonic Pitch Detection

### Sandbox Notes

• Still in progress. I haven't made any of the test cases or snippets yet.
• This is intended to be an easier and more accessible alternative to Polyphonic Pitch Detection.
• Would this still be a duplicate of the polyphonic version? Solutions could "work" in both challenges, but algorithms that work for this one would perform extremely poorly (typically monophonic algorithms fail outright with multiple waveforms and produce a completely incorrect frequency) for the other.

Take an array of samples, and output the frequency of the waveform found in the samples.

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.

You must output the frequency detected (in hertz) with up to 2 decimal places of precision.

### Test Cases

Each test case is on it's own line. Each line begins with the name of the test case, followed by a semi-colon (;), 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:

Test Case Name;123.45;3,75,1234,56789,4321,-23,-408,-9266,41,0,etc...

(link to test case file, will include synthesized waveforms, real instrument sounds, added noise, different pitches)

### Scoring

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

(snippet for calculating score)

### Rules

• No built-ins that detect pitch or extract waveform frequencies are allowed.
• Helper functions that are designed to aid frequency analysis like FFT are permitted.
• You may optimise your solution for the test cases, but you cannot hard-code the results for these specific test cases.

### Play Samples

You can hear what a list of samples sounds like by pasting it into this snippet:

(snippet for playing sample strings or sine waves using web audio)

# Letter subsets

Consider two letters, L1 and L2. L1 is a solid subset 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 ≠ L2:

L1  L2
F   E
C   O
I   T
I   L
O   Q


Two letters L3 and L4 share the relation of variant subset (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 ≠ L4:

L3  L4
F   E
C   O
I   T
I   L
O   Q
V   A
I   H
H   I
I   N
I   M
I   B
I   V
I   X
I   Z
I   P
I   E
I   W
I   R
I   K
I   F
I   D
N   Z
Z   N
T   H
G   Q


## Specs

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 ss, vs, or nothing. Your program may do anything if the input is not a pair of uppercase letters. Your program should pass all of the above relations when given those letters as input.

# ~META~

Suggestions? Any letters in v.s. or s.s. I missed? Any you don't understand?

• If I is a single vertical line (which it is in some fonts, but not all), why is it an s.s. of T and L but only a v.s. of B, D, E, F, H, K, M, N, P, R? (And in some fonts it might also be an s.s. of W). – Peter Taylor Feb 2 '16 at 12:45
• @PeterTaylor I missed those, thanks. – Conor O'Brien Feb 2 '16 at 14:51

# Reasoning

## Introduction

Reasoning is one of the most important human capabilities, often counted as what separates us from other species. This capacity, however, takes up a substantial portion of our meaty brain. Your challenge is to recreate a reasoning system in a much abbreviated form.

## Definitions

The challenge, is, given a universe of objects and n-ary relations and a set of facts and laws on the relations, to determine whether a hypothesis is a fact or not. The language in which these are expressed are drawn from the alphabet "012345789RC@ " under the following rules (in EBNF with an ad-hoc expansion).

1. An unbound-variable is denoted by a sequence of digits denoting a non-negative integer. For example, 3 is a variable which we may read as "object 3".

natural = non-zero-digit , { digit } ;

unbound-variable = natural ;

2. A bound-variable is denoted by a "@" followed by an unbound variable.

bound-variable = "@" , unbound-variable ;

3. A variable is either a bound-variable or an unbound-variable

variable = bound-variable | unbound-variable ;

4. A relation-identifier is denoted by a capital "R" followed by a single digit denoting its arity and then a natural number identifying it.

relation-identifier(n : digit) = "R" , n , natural ;

5. A relation is denoted by a relation identifier followed by a sequence of variables whose length matches its arity.

relation = relation-identifier(a) , a * { " " , variable } ;

6. A consequence is denoted by a capital "C" followed by two relations.

consequence = "C" , relation , relation ;

7. An expression is either a consequence or relation of that magnitude.

expression = consequence | relation ;

The inference rules are the following:

1. From C R R' and R (where R and R' are relations) to infer R'.

2. From E to infer E{@m=p} where E{@m=p} is the expression E with all instances of bound-variable @m replaced by variable p.

## The Challenge

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: "true" (case-insensitive), "+", "1", "yes". Any other input will be interpreted as claiming the hypothesis cannot be infered from the facts.

## Test cases

>input:
R00
>expected output:
false|no|whatever

>input:
R00
R00
>expected output:
true

>input:
R10 0
R10 @1
>expected output:
true

>input:
R20 4 9
R20 9 4
CR20 9 4R20 4 9
>expected output:
true

>input:
R2859 7 163
R2859 @0 163
>expected output:
true

>input:
R10 5
R10 1
CR10 1R10 2
CR10 2R10 3
CR10 3R10 4
CR10 4R10 5
>expected output:
true

>input:
R10 6
R10 1
CR10 1R10 2
CR10 2R10 3
CR10 3R10 4
CR10 4R10 5
>expected output:
false

>input
R20 4 5
R20 9 6
CR20 6 @0R20 7 @0
CR20 @0 7R20 @0 4
CR20 @0 9R20 5 @0
CR20 @0 @1CR20 @1 @0
>expected output:
true

>input
R20 4 5
R20 9 6
CR20 6 @0R20 7 @0
CR20 @0 7R20 @0 5
CR20 @0 9R20 5 @0
CR20 @0 @1CR20 @1 @0
>expected output:
false


This is a golf competition, the fewest number of bytes wins. Other restrictions are TBD.

Determine if a given loan repayment schedule is a weekly or a daily schedule?

Problem scope

Its a real life problem which I recently fixed with >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.

Problem Description

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.

No repayment would be received on bank holidays which include weekends.

A weekly repayment schedule means that borrowers have agreed to make regular fixed repayments on a particular weekday every week. A Daily repayment schedule means that borrowers have agreed to make a fixed repayment on all working days till loan gets repaid fully.

Few Borrowers may do one of these besides doing regular repayments.

1. Choose not to return on some scheduled repayment days.
2. Choose to make only partial repayment on some scheduled/unscheduled repayment days.
3. Choose to make extra repayment to catch up on previous payment or just doing prepayment.
4. May skip making any payment for extended duration.

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.

A sample demonstrating above conditions from a daily repayment schedule could be as follows for a person not completely regular

Date Repayment amount

1-Feb-2016 500

2-Feb-2016 500

4-feb-2016 500

8-Feb-2016 400

10-Feb-2016 1000

10-Mar-2016 500

11-Mar-2016 500

A sample demonstrating above conditions from a weekly repayment schedule could be as follows for a borrower not completely regular

Date Repayment amount

1-Feb-2016 500

8-Feb-2016 500

17-feb-2016 500

22-Feb-2016 400

07-Mar-2016 1000

14-Mar-2016 500

11-Mar-2016 500

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.

I have clarified some doubts at https://codegolf.stackexchange.com/questions/71334/determine-if-a-given-loan-repayment-schedule-is-a-weekly-or-a-daily-schedule . Check those if possible.

# Is the plate balanced? code-golf

Given a grid of 1 digit numbers and a coordinate, tell me if it is balanced.

### How to balance check

Explanation coming. I know how it works for 1d (Balance a set of weights on a seesaw), but don't know how it would work for 2d.

### Input

Input will be a grid of 1 digit numbers. Each number corresponds to the amount of weight at that location.

### Examples

Input:
111
111
111
1,1

Output:
truthy

• Will the center of mass always be at integer coordinates? – lirtosiast Feb 8 '16 at 2:42
• No, but this is the only example I know is correct right now. Unfortunately I haven't learned now to solve this type of problem yet, and the Wikipedia entry doesn't help for this use case. – J Atkin Feb 8 '16 at 2:55
• Center of mass in 2D can be found by just calculating the coordinates separately; that is, you sum up the rows and calculate the y value, then sum up the columns and calculate the x value. – lirtosiast Feb 8 '16 at 4:03

# Sloppy Shuffle

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!

The Rules

• 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.
• 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.
• No matter what (finite) input is given to the program, it must produce some permutation of the numbers.
• If given the same input, the program must always produce the same permutation.
• Nothing should be produced on stderr.
• Standard restrictions apply.

Input/Output

Default input methods (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.

Default output methods (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.

Scoring

This is code golf. The shortest answer in bytes wins!

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.

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

Example

This is an example of a program which fulfills the requirements in Lua:

-- return a number from (1,n) depending on input
local function pick_from(n)
local str = io.read() or ""

-- always proceed even if input is not a number
local num = math.floor(tonumber(str) or 0)

-- guard in case of parsing overflow (e.g. input of 1e99999999999)
if num ~= num or num > 1000 or num < -1000 then
num = 0
end

return 1 + (num % n)
end

-- create a list of 52 numbers
local deck = {}
for i = 1, 52 do
deck[i] = i
end

-- Fisher-Yates shuffle algorithm
for i = 52, 1, -1 do
local j = pick_from(52)
if i ~= j then
deck[i], deck[j] = deck[j], deck[i]
end
end

for i = 1, 52 do
print(deck[i])
end


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.

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.

• As far as I can tell, printing the input unchanged satisfies the spec. – feersum Feb 7 '16 at 14:28
• "Each possible finite input must produce some permutation of the numbers." If the input is not a valid output (as most are not), simply printing the input does not satisfy this requirement. – tehtmi Feb 7 '16 at 20:07
• Okay, the intent was that every input must be accepted, but I can see how that is not clear from what I wrote. I'll try to edit it. – tehtmi Feb 7 '16 at 20:12
• Okay, so I see that there must be some input that corresponds to every permutation. But input can be literally anything? I'm also confused by what you mean by "uniform" that is usually used in regard to some sort of probability distribution, but you say that the same input must always do the same permutation, so there doesn't seem to be anything random. – Liam Feb 7 '16 at 21:15
• Yes, the intent is that the program should accept literally any input and produce a valid output. Also true that there is nothing random. I am trying to use "uniform" to evoke the sense that outputs would be evenly distributed across inputs (maybe for each bounded size). However, since I am explicitly not requiring it, it does not need to be well defined for the question to be well-formed. I thought that using the word "shuffle" people would think they are required to use a uniform shuffling algorithm. Maybe it is better to leave this part off. – tehtmi Feb 7 '16 at 22:11
• Why don't you go with the defaults (function/full program, input via stdin/function argument/command line, etc)? They've proven to work for most challenges. – nimi Feb 7 '16 at 23:03
• I don't want to restrict anyone. I thought it was safer to be more specific, but I guess maybe people don't need to be told. I was a little worried about input methods since my idea of accepting arbitrary input may not have a well-established meaning for all input methods. However, I've tried to edit the question to remove all such restrictions. – tehtmi Feb 8 '16 at 1:07
• @tehtmi: the main problem with very strict rules is that whichever one you choose it will fit some languages and will be awkward in others. Let's take your requirement for nl/space/tab separated numbers as an example: in some languages it's just a "print" of an array variable. Other languages would print brackets around and commas in-between the elements, so they have to loop over the array and print each number individually. People don't like such disadvantages for their favorite language. Please consider allowing "native array format" or "any reasonable format" for the output list. – nimi Feb 8 '16 at 4:29
• The obvious golfed approach is to say that if the input is a valid output, print the input; otherwise print the identity permutation. In no way does it meet what I would presume to be the intent of the challenge, but it does meet the spec. – Peter Taylor Feb 8 '16 at 8:17
• ^ yeah. I would recommend narrowing the input specs. "Input can be anything" will usually get you into trouble. – Liam Feb 8 '16 at 19:45
• @Peter Taylor: I actually have no problems with that solution. I'm not convinced, though, that it would obviously be the best solution. Probably it would be best in some languages and not in others. Checking whether an input is a permutation seems to be of similar complexity to many shuffling algorithms, but it may be more likely that some languages would have built-ins to do it. – tehtmi Feb 8 '16 at 22:19
• @Liam: I think the input spec is the only thing that makes this problem interesting (and original -- there have been other shuffling golf challenges). Maybe nobody thinks it is a good question in which case it can die in the sandbox, but at least for myself, having the input as another dimension over which to optimize seemed somewhat interesting. – tehtmi Feb 8 '16 at 22:22
• Many many languages have built-in sort, and sorting and then checking that a[i] = i+1 for all i is sufficient. – Peter Taylor Feb 8 '16 at 22:27
• You could possibly around the described solution by limiting input to a set number of characters and then require that each of the 52! outputs have at least a certain number of things that map there, or require that every output has the exact same number of inputs that map there. – Liam Feb 8 '16 at 22:41
• Okay, so you are iterating through a list once and doing some simple logic. In my (ungolfed) example, I iterate through a list once and do some simple logic. My loop can basically be reduced to three logical steps -- input, sanitize input, swap. Your loop only has one logical step -- compare. However, you have three logical steps before your loop -- input, sanitize input, sort. In golf, it generally doesn't matter if steps are in a loop or not. I'm sure we could argue about my exact breakdown of the steps, but it still seems to me that both methods are similar. – tehtmi Feb 8 '16 at 22:46

# Prove that this program terminates or run forever

## Introduction:

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

# Challenger

## Challenges

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.

## Rules

1. Proof must be written formally.
2. No computer aided proof. (i.e. running the program, or convert it into Coq, Idris, or another dependent-typed language)
3. This is not challenge, so do not obscure the program.
4. 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.
5. Your program should not depend on unsolved problems.
6. Cracking your own submission is not allowed.
7. Score for submission:
• Cracked : -5
• Verified : 10
• Flawed : -15

# Prover

## Challenges

Your challenge is to proof that the program that is posted in Challenger thread is halting or run forever.

## Rules

1. Proof must be written formally.
2. No computer aided proof. (i.e. running the program, or convert it into Coq, Idris, or another dependent-typed language)
3. Score for submission:
• Verified (With no proof from owner) : 8
• Verified (With flawed proof from owner) : 12
• Flawed : -8

# Sandbox Question

What language should I use? The requirement is:

1. Turing Complete
2. Imperative
3. Easy to understand, even to noncoder
4. Easy to write

Also, I need help with the leaderboard

• Why is the downvote? – Xwtek Feb 8 '16 at 13:41
• as i understand it, the robber doesn't actually write any code, huh? – undergroundmonorail Feb 8 '16 at 15:09
• @undergroundmonorail I don't know which from Prover and Challenge is the robber? – Xwtek Feb 9 '16 at 3:55
• This is unfeasible. If I write a program that stops when it disproves the Goldbach conjecture, no one here (including me) is going to know if it stops or loops forever (without becoming instantly world famous). – Calvin's Hobbies Feb 9 '16 at 13:15
• @Calvin'sHobbies You have to provide proof after 6 days. If not, the submission will not be safe and you will not get score at all. – Xwtek Feb 9 '16 at 13:19
• It becomes really a question of who can find the most obscure mathematical result which can be translated into code rather than a programming contest per se. – Peter Taylor Feb 9 '16 at 14:34

# How clean is my snow? code-golf

Idea shamelessly take from https://codereview.stackexchange.com/questions/118538/how-clean-is-my-snow#comment221029_118538

## The challenge

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

## Determining where the background is

[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]

# ToUpperCase... Mathematica style

For this challenge, you must write a program or function that converts every character in a string to upper case. "Wouldn't this be too broad/a duplicate/etc.?" you ask. Nope; you have to exactly implement Mathematica 10.1's ToUpperCase function!

## Note

ToUpperCase works quite peculiarly on Unicode. For example, ß converts to SS! The full replacement list (from:to(,to);):

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;


## Rules

• You cannot use a built-in that completely solves this challenge.
• If a function is written, the input is guaranteed to be a single string or equivalent.
• All characters not specified in the replacement list are to remain unchanged.
• All codepoints will be less than U+10000.
• If and only if your language can only take bytes as input, the string will be encoded in UTF-8.
• Standard loopholes are disallowed.
• Have fun!

# Meta Questions

• What are some good test cases for this challenge?
• Is there something that I possibly missed while writing this challenge?
• '"Wouldn't this be too broad?" you ask.' No I would ask "Isn't this a duplicate?" ;) – Martin Ender Feb 11 '16 at 13:16
• "You can't use Mathematica for this challenge." Why not just ban the built-in? – Martin Ender Feb 11 '16 at 13:16
• Further notes: 1. the list of transformations is short enough to be included in the post to ensure that it's self-contained. 2. You could just call it "Unicode-aware case conversion" or something. I'm pretty sure that the built-ins of languages like C# and Java will also perform the conversion the same way. – Martin Ender Feb 11 '16 at 13:19
• @insertusernamehere Looking at the list that's actually the only special one. – Martin Ender Feb 11 '16 at 13:21
• >>> "ß".upper() 'SS' - Python might not do the whole list the same way, but it does do some. So reiterating Martin's comment, I wouldn't be surprised if there was something out there which did most of the list the same, if not all... – Sp3000 Feb 11 '16 at 13:23
• @MartinBüttner I'm planning on possibly making a series out of this. – LegionMammal978 Feb 11 '16 at 13:28
• How close to solving the challenge does a builtin have to be to be disallowed? e.g. what if a builtin only gets half of them correct, and needs to encode the rest? 75% correct? 90% correct? – Sp3000 Feb 11 '16 at 13:32
• The list needs a bit of cleaning up. In particular, 223:83,83 is clearly erroneous. – Peter Taylor Feb 11 '16 at 14:38
• @PeterTaylor Why? Isn't 223 the character code of ß and 83 the character code of S? – Martin Ender Feb 11 '16 at 15:38
• @MartinBüttner, oh, I see. So what needs fixing is to document the list and describe its format. – Peter Taylor Feb 11 '16 at 15:57
• 1. I'm fairly certain Mathematica can in fact encode any Unicode character, most likely by using surrogate pairs (two characters from U+D800 to U+DFFF). 2. Uppercasing ß as SS is fairly standard, but why on Earth would Mathematica uppercase ÿ as Y when there's a perfectly good Ÿ available? – Dennis Feb 11 '16 at 20:17
• @insertusernamehere I didn't want to break peoples' browsers with non-rendering characters (Mathematica uses its own custom font). – LegionMammal978 Feb 11 '16 at 23:11
• @Dennis 1. Its default encoding is UTF-8, trying to paste emoji makes the interpreter explode, FromCharacterCode only accepts up to U+FFFF, and trying to use surrogates renders a two invisible characters, which makes me believe this is the case. 2. One does not question the inner workings of Mathematica. – LegionMammal978 Feb 11 '16 at 23:14
• OK, my mistake. A bit of googling revealed that Mathematica's Unicode support is incomplete and exceptionally buggy. – Dennis Feb 11 '16 at 23:36

# Use Simpson's Rule

Simpson's rule 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.

As I learned in first-year calculus, the form of Simpson's Rule we'll be using is:

where the width of each interval is h.

Equivalently, this is the dot product with the vector h/3([1,4,2,4,...,1]) the same length as the input.

### Input

• An array of n>1 real numbers representing the values of f at x-values equally spaced by h. n will be odd.

• h, a positive real number.

### Output

The area approximation that Simpson's Rule gives.

### Test cases

[0,0,0], 1 -> 0
[3,1,4,1,5], 1 -> 8


• Simpson's rule requires an even number of intervals, so there has to be an odd number of endpoints. – Dennis Feb 12 '16 at 6:22

# Implement the Block Sort sorting algorithm

Block sort is an interesting sorting algorithm (comparatively speaking). Here are some of its important properties:

• O(n log n) time complexity in worst and average case
• O(n) time complexity in best case
• O(1) space complexity (not including the space that holds the list itself)
• Stable

If you check out this table comparing sorting algorithms, you'll see that it's the only one that has the whole row highlighted in green.

Your challenge is to write an implementation of the block sort algorithm in the fewest bytes.

• I take it you're actually going to explain block sort in the spec before posting this? – Martin Ender Feb 14 '16 at 18:32
• @MartinBüttner I'd assume so, but I don't know if I'll ever get around to it, mainly because it seems pretty tedious/complicated. – PhiNotPi Feb 14 '16 at 18:40

# Advent of Code, puzzle 1

I don't know if anyone here spent their December working on the problems found on Advent of Code, but I thought some of the simpler problems might make good code golf puzzles.

So, here's the first one. There will be two challenges, and the solution should be a pair of programs, each of which solves one challenge.

Score is based on the combined byte count of the two programs.

(An alternative would be to also allow a single program that produces a tuple of the two solitions- what do you think?)

Input: An unbalanced string of open and close brackets.

Output 1: The count of the number of open brackets take away the number of close brackets.

Output 2: The index of the first close bracket that causes the running sum to reach -1.

• This could be a copyright problem. – Martin Ender Feb 15 '16 at 16:11
• I'll contact the creator and ask his permission to reproduce his problems. I would not imagine it to be an issue but you're right that I should verify first. – A Simmons Feb 15 '16 at 16:18
• I'm generally not a fan of asking for multiple programs in the same challenge and combining their byte count, if the two solutions don't influence each other at all. I'd say either ask for a single solution that computes both numbers at once, or choose one of the problems. (Also, FYI the first challenge is trivial in GolfScript and CJam, because ( and ) are the operators for decrement and increment.) – Martin Ender Feb 15 '16 at 16:34
• Yeah I actually used these as practice problems when my partner and I were learning CJam over the weekend, but I can't see anything better than a 5-byte solution in CJam for the first one: 0q~W*. Perhaps just putting the second challenge is better for this one. – A Simmons Feb 15 '16 at 16:39
• IIRC one or two of these were posted in December and deleted for copyright reasons. – Peter Taylor Feb 15 '16 at 16:58
• The creator has now given the go-ahead for these problems to be replicated twitter.com/ericwastl/status/699455417768923137 – A Simmons Feb 16 '16 at 11:10
• Might be worth including that in the challenge to avoid repeating the same discussion when it goes to main. – Martin Ender Feb 17 '16 at 8:22

# Knights and Knaves posted

Undeleted so that comments are visible

• – PhiNotPi Feb 3 '16 at 2:44
• I find some of the wording rather confusing, in particular the statement that Is is a logical operator (shouldn't that be Iff?) and the references to de Morgan's laws, which are theorems and not operators. But essentially ISTM that this question differs from the other question only in the parser (which makes some simplifications and adds a case to parse =>), and I would vote to close it as a duplicate. – Peter Taylor Feb 3 '16 at 14:34
• @PeterTaylor I'll add some stuff to clear up the IS thing, because you're right, it isn't really a logical operator, I was just trying to keep it simple. I think that the parsing of conditionals and having to actually use De Morgan's makes this challenge significantly more complicated than the other. Especially given that other is literally focused on the English parsing, whereas this is focused only on the logic. Basically you cannot "trivially" change answers from the other question to solve this one. – Liam Feb 3 '16 at 17:49
• I really can't see any fundamental difference between the two questions with respect to de Morgan's laws. The earlier question doesn't have a direct Not operator, so requires abusing Nor, but it allows arbitrary nesting of clauses. – Peter Taylor Feb 3 '16 at 21:11
• @PeterTaylor Could you quote the other challenge? I'm reading it and not seeing anything to do with De Morgan's. I'm specifically looking at the "Parsing" section. – Liam Feb 3 '16 at 21:15
• both [clause] and [clause] either [clause] or [clause] neither [clause] nor [clause] between them contain everything you need to set up a clause equivalent to ~(A ^ B) or ~(A v B). – Peter Taylor Feb 3 '16 at 21:28
• @PeterTaylor Yes, but you don't have to parse the negations of con/disjungtions and hence do not need to use De Morgan's at all. Sure, they end up equivalent at the end of the day but that's not the point. I'm not allowing people to read inputs and say "Hey, X is equivalent to Y... why don't I just enter Y instead." If it can't parse X, then it fails the spec. – Liam Feb 3 '16 at 21:33
• There's nothing in your question which obliges people to use de Morgan's laws either. They just need to brute-force all possible assignments and evaluate the expressions. – Peter Taylor Feb 3 '16 at 21:36
• @PeterTaylor Yes, and they would be in their rights to do so. However, that is not how people actually solved the other question. And it may or may not be the best way to solve this one. So sure, that is a valid concern, but not evidence that this is a duplicate. – Liam Feb 3 '16 at 21:39
• It is how ugoren solved the previous one; Howard's solution is harder to understand, so I'm not sure exactly how it works. – Peter Taylor Feb 8 '16 at 22:43
• @PeterTaylor Hmm, sorry I must have missed that. That is true. There is still the matter of conditional logic however. – Liam Feb 8 '16 at 22:58

## Diopter lenses

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.

## The problem

Your program should take one diopter value n as an input. The input need not be validated.

You should output in any human readable form a list of diopter lenses such that:

• the maximum diopter value you can form by stacking the lenses is n,
• every diopter from 1 to n can be formed by stacking a combination of those lenses,
• there exists no set of fewer lenses that complies to the above rules.

## An example

Given the input of:

6

Print the output of

1
2
3


Because:

1=1
2=2
3=3
1+3=4
2+3=5
1+2+3=6


## The rules

This is code golf, so the objective is to write the shortest possible code, but, 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.

Any type of output is accepted, as long as the program outputs correct clearly separated positive integers and no other alphanumeric character.

## My solution

python 2, 52 bytes, base64 encoded

bj1pbnB1dCgpCno9MQp3aGlsZSAyKnotMTxuOnByaW50IHo7eio9MgpwcmludCBuLXorMQ==

• I think this is too much of a math problem and not enough of a code-golf problem. – lirtosiast Feb 15 '16 at 20:58
• That's exactly why I posted it here. Not having seen many on this site before, I was curious whether such problems were adequate for code-golf. – Fran Borcic Feb 15 '16 at 21:02

# Plotting Dynamical Systems in ASCII

Input:

• A Function to and from the real plane (henceforth R2) , call it F

• A point in R2 that is to be the center of a disk, call it c

• A radius, call it r

• An integer representing the number of iterations to be performed, call it n.

Output:

You are to output n+1 ascii "images". The first depicts the disk D (with center c and radius r) and the ith image depicts F^i(D), aka F(...F( F(D) )...) where we have applied F to D, and then applied F to F(D) and so on until we have applied F i times.

Input Details:

• F will always be polynomial. See below for acceptable examples.

• Any c = (c1,c2) given will satisfy |c1|<50 and |c2|<25.

• Also, r will always be small enough that D the disk around c with radius r will contain no points with an x coordinate greater than 55 or less than -55 and no y coordinate greater than 32 or less than -32.

• n will be positive and less than 5.

Output Details

• We will be looking at a rectangular subset of R2 given by { (x,y) : -60 <= x <= -60 and -33 <= y <= 33}. i.e. a rectangle with side lengths 120 and 66 centered at the origin.

• Each output image will contain 320*320 characters. This represents the above region in R2 with gradations of 0.5 along each axis.

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

      y
^
|
.............................
7 .............................
.............................
6 .............................
.............................
5 .............................
.............................
4 ............................
.............................
3 .............................
.............................
2 .....................b.......     b =(10.5,2)
.............................
1 ..a..........................     a = (1,1)
.............................     z = (0,0)
0 z............................  --------> x
0 1 2 3 4 5 6 7 8 9 | | | | |
10| 12| 14
11  13

• Points that are empty (i.e. not in F^n(D)) will be represented by the . character, whereas filled spaces will be represented by #.

• Each image will have the same or fewer # represented points in it because we will not be displaying points that are outside the region.

How do these maps work?

These are iterative maps we will be dealing with. For each point # in a given image, to get the next image, you will apply the given map F 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.

For the purposes of this challenge, the image of a point should be rounded to the nearest 0.5.

A map might be F(x,y) = (4x(1-x), x+y)

# Hourglass simulator

Write a full program or function to simulate an hourglass.

### Input

n, the number of seconds on the hourglass.

### Behavior

At the start, there are n seconds on a timer, and the timer is counting down. When the user presses the spacebar with t seconds left, set the time left to n-t. Terminate the program when time runs out.

This models an hourglass where the top of the hourglass is initially filled with n 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.

[Is there anything I'm missing? This spec seems really short.]

• I don't understand this spec. Are you displaying an hourglass? Does the program output anything? – xnor Feb 16 '16 at 0:25
• "when the spacebar is pressed" seems quite limiting, especially for terminal interaction which might not flush STDIN before the end of the line. I'd allow any sort of user action, but if you want to make it specific, then sending a line/hitting enter would probably allow a lot more languages to participate. – Martin Ender Feb 16 '16 at 8:25
• You need to state exactly how the hourglass should be displayed – ASCII-only Feb 16 '16 at 9:28
• @somebody As far as I understand the challenge the program shouldn't display anything. It should just act like an hourglass. – Martin Ender Feb 16 '16 at 14:00
• @xnor cc the above – Martin Ender Feb 16 '16 at 14:00
• Thomas, seems likely this is going to come up again on main if you leave the spec as it is. Maybe don't talk about the "top of the hourglass" and "seconds of sand" and flipping "by 180°" but phrase the challenge in terms of a timer instead, whose current value gets subtracted from n each time there's user input. – Martin Ender Feb 16 '16 at 14:02
• @Martin I agree. – lirtosiast Feb 16 '16 at 15:58
• @lirtosiast shouldn't it replace time with n-timewhen flipped instead? – ASCII-only Feb 17 '16 at 6:26
• @somebody Oh, I guess that's the same behavior. – lirtosiast Feb 17 '16 at 6:31
• Since taking real-time input is limiting for some languages, what if you took in a list of times at which the presses happen? – xnor Feb 17 '16 at 7:56

# Dice sums from side values

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

xx   x
xx   xx  xxx


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.

The layout of a die is always the following:

    +---+
| 1 |
+---+---+---+---+
| 2 | 3 | 5 | 4 |
+---+---+---+---+
| 6 |
+---+


For example if the input is 3 2 1 1 2 6 6 5 there are four possible configurations with top views:

623, 633, 643, 653 giving the output list 11, 12, 13, 14


with the sides always being

 566
3XXX2
211


For the input 1 1 2 2 3 3 2 2 there is only one configuration with the top view:

46
31 giving the one element output list 14


## Examples

This is code golf so the shortest entry wins.

Related code golf with a single die: Determine dice value from side view

• Is there any input where multiple layouts are valid? (If so you'll need test cases for that.) Also your premise is a bit weird since the number of dice isn't constant. ;) – Martin Ender Feb 27 '16 at 16:32
• @MartinBüttner I think there will be inputs with multiple valid layouts but I don't have code yet to check it. I will change the premise to "the 8 side numbers are all I remember". That might be a bit sensible. – randomra Feb 27 '16 at 18:40

# Length of a month starting from a specific day

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.

It can be calculated this way:

• 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.
• Otherwise, output the number of days in the next month + number of days starting from the current day in the current month.

This is code-golf. Shortest code wins.

## Examples

2016-01-21  ->  31
2016-01-30  ->  31
2016-01-31  ->  30
2016-02-29  ->  29


Should leap years be supported?

# Repeatedly convert from minimal base to base 36

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.

## Rules:

• You may not use base conversion builtins.
• From 0 to 35 in base 36 is defined as:
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
• All submissions will be tested on this cloud 9 workspace and should be uploaded for testing (along with any updates) on this GitHub repository.
• All submissions must be written for compilers/interpreters that:
• Are free to use.
• Do not take up excessive space.
• Can run with simple installations on Ubuntu 14.04.

# Test Cases:

Coming soon
• Do you expect to get runtimes large enough to be measurable? – Peter Taylor Mar 1 '16 at 10:32
• @PeterTaylor Yes - I expect to convert lists of large (arbitrarily precise) numbers. – Addison Crump Mar 1 '16 at 13:17
• That doesn't really answer the question. A random 1000-digit base-35 input will become a roughly 990-digit base-36 string after the first step, and the probability of going to a second step is about (1/36)^990, which is pretty negligible. But one base conversion of a number on the order of 1000 digits isn't going to take long enough to time. I would hazard a guess that you need input on the order of hundreds of millions of digits to be timeable, and then the business with the loop is completely pointless because for practical purposes it will always run once. – Peter Taylor Mar 1 '16 at 15:43