485
\$\begingroup\$

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.

To post to the Sandbox, scroll to the bottom of this page or click on the "Add Proposal" link below, 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. 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, replace the post here with a link to the challenge and delete it.

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

The Sandbox works best if you sort posts by "active".

Add Proposal

Search the Sandbox

Browse your pending proposals

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]

| |
\$\endgroup\$

2923 Answers 2923

1
73 74
75
76 77
98
0
\$\begingroup\$

Unicode reversible programs

The goal is to make a program that includes unicode formatting characters that when executed as-is generates a OEIS sequence, and when copied as its rendered* and executed, returns a different sequence.

  • The renderer is one that properly reacts to unicode formatting. For example with RLO the text should be reverted. (Its stored as "\u202etest" but renders as "tset"

This is will be so the answer with less bytes wins.

| |
\$\endgroup\$
  • 3
    \$\begingroup\$ What do you mean by "copied as its rendered and executed"? \$\endgroup\$ – Peter Taylor Feb 1 '18 at 11:18
  • \$\begingroup\$ @PeterTaylor I mean that for example the text "\u202e hello" is rendered as "olleh " because U+202E is a unicode control character that reverses text (when rendered) \$\endgroup\$ – iovoid Feb 1 '18 at 19:28
  • \$\begingroup\$ Define it objectively. How browsers/text editors handle copy-paste are implementation-defined. (which browsers/text editors, which exact ways to copy-paste, put the pointer on which pixel of the screen, etc.) \$\endgroup\$ – user202729 Feb 2 '18 at 5:35
  • \$\begingroup\$ U+202E is not a Unicode control character: the Unicode control characters are the ranges U+0000 to U+001F and U+007F to U+009F. \$\endgroup\$ – Peter Taylor Feb 2 '18 at 12:19
  • \$\begingroup\$ Also: this question talks about characters and bytes but it doesn't address the relationship between them, which is a minefield. What about languages which don't use UTF-8 or UTF-16 for their source? What about languages which use either according to a command-line flag: can the transformed program change the state of that flag? \$\endgroup\$ – Peter Taylor Feb 2 '18 at 12:26
  • \$\begingroup\$ @PeterTaylor languages that dont use utf-8 it in their source can use a escaped form such as (0xe2 0x80 0xae). Also thanks for pointing that its actually a formatting character (not control) \$\endgroup\$ – iovoid Feb 2 '18 at 18:20
  • \$\begingroup\$ So basically split on the unicode char and reverse all that's after it? Possibly multiple times? Doesn't sound too interesting. \$\endgroup\$ – Magic Octopus Urn Feb 2 '18 at 21:29
  • \$\begingroup\$ "for example"? Questions (challenges) need to be self-included. List all of them please. \$\endgroup\$ – user202729 Feb 3 '18 at 5:29
0
\$\begingroup\$

Tags: Codegolf

Title: evil detection

When given any (you may choose the format and you should assume integer input) input, the output should be true if the input is a palindrome and false if not (or 1/0 or any equivalent).

To make it (a lot) harder, your code must work with a result that fulfills the challenge inverted if read backwards. So for a palindrome input, forward gives true, backwards false.

Example:

If your code is "abc12" and the input is 1221, your code should produce true-ish and "21cba" (your code read backwards) should produce false-ish.

Bonus if you think that's to easy: produce false if and only if the input is 666 forward and true backwards.

| |
\$\endgroup\$
  • 2
    \$\begingroup\$ Duplicate \$\endgroup\$ – Shaggy Feb 5 '18 at 16:58
  • \$\begingroup\$ First, I want to say thanks for using the sandbox! Also, I do think you could go somewhere with this idea that doesn't make it a duplicate. Your idea is marginally different, in that it only requires the code to behave the same forward and backwards, rather than actually be a palindrome. While I think for palindromes it will almost always be best to have a palindrome, perhaps you can think of a different pattern that makes it more interesting? I'll let you know if I think of anything. \$\endgroup\$ – FryAmTheEggman Feb 5 '18 at 22:23
  • \$\begingroup\$ @FryAmTheEggman, I don't think the fact that the code need not be palindromic is enough to make this not be a dupe; many of the solutions to the challenge above would also be the optimal solution here. Maybe if this one required that the code not be a palindrome and also required that it output a different pair of consistent and distinct values when run in reverse, it might be enough to differentiate it? \$\endgroup\$ – Shaggy Feb 6 '18 at 9:25
  • \$\begingroup\$ Thanks to both of you, I'll have a look at the other answers, but I agree that allowing the code to be semi-palindromic is not enough (unless the other answers are all extremely long, I haven't looked yet). I'm thinking about making the code required to not be symmetric, but haven't figured out what to do with the input to make it fit \$\endgroup\$ – DonQuiKong Feb 6 '18 at 9:28
  • \$\begingroup\$ @Shaggy That seems like a good start for changing it. For the record, I definitely think that as it was when I posted it was a duplicate, I just thought there was something good in this challenge and I didn't want it to just be discarded! The unfortunate thing about just requiring non symmetry is that comments/newlines could often just be added at the end without much cost, but I do think there is a good challenge here, somewhere. \$\endgroup\$ – FryAmTheEggman Feb 6 '18 at 18:39
  • \$\begingroup\$ @fryamtheeggman how about this? \$\endgroup\$ – DonQuiKong Feb 6 '18 at 18:59
  • \$\begingroup\$ I think the problem with this is that while some of the answers to the other question will no longer work, some are still usable here with only a slight modification, so I don't think this will cut it. \$\endgroup\$ – FryAmTheEggman Feb 6 '18 at 19:31
  • \$\begingroup\$ @Fryamtheeggman and if I make the bonus question mandatory? But I'll think some more \$\endgroup\$ – DonQuiKong Feb 6 '18 at 19:42
0
\$\begingroup\$

Build a Brainfuck transpiler

Your job is to build a program that transpiles valid brainfuck to a language (not brainfuck!) of your choice.

You are not required to handle cases where the program is invalid (mismatched [ ]s), or contains characters that are not +-<>[],. but all other cases must be handled.

Size limits on your input or output are fine as long as they are imposed by computer restrictions, like RAM.

The programming language you transpile to is covered under the "What defines a programming language" rules, and must have been created before this challange.

In extension to not transpiling to brainfuck (cheater!) you can't use a brainfuck derivative or trival brainfuck substitution as the transpiled to language either.

Scoring

Programs will be scored with the average ratio of bytes in the input brainfuck program to the output transpiled result, as based on the examples.

Meta questions

This is a rough draft!
What tags should be associated with this?
How can I improve the scoring system?
What examples should I use to keep the scoring fair, but prevent obvious tricks?
What loopholes are there in this rough draft that I need to patch?

This entire thing will be reorganized when I get enough info to make a better writeup.

| |
\$\endgroup\$
  • \$\begingroup\$ I'd tag it with code-challenge and brainfuck. Once you post the examples the scoring system seems to be fine, the major problem would be hardcoding but this is a standard loophole, so this should be fine. Also you should probably consider adding a non-terminating example. About preventing brainfuck derivatives: I'm not sure if this is well-defined enough, maybe others have some ideas? \$\endgroup\$ – ბიმო Feb 10 '18 at 14:22
  • \$\begingroup\$ @BMO About hardcoding: Just hide the official test cases. You don't need to prevent BF derivative, they would just be boring (and downvoted most likely). Also it's very hard to define them (What about 2D BF? What about Unary? What about Random BF / self-modifying BF?) \$\endgroup\$ – user202729 Feb 10 '18 at 15:39
  • \$\begingroup\$ Also, BF is too unclear as a language specification. (is memory wrapping or infinite to one end or infinity to both ends? Are values positive/negative/modulo 256? etc.) \$\endgroup\$ – user202729 Feb 10 '18 at 15:41
0
\$\begingroup\$

Chiasmus Indenter


Chiasmus is a literary form that is similar to palindromes. Some ideas are presented and then presented again in reverse order, often phrased differently.

Natural language processing is hard, so I'll be using a more computer-friendly definition. A chiasmic string is made up of a series of substrings that are repeated in reverse order in the second half of a string. Formally:

  • If a is some non-empty string, then aa is chiasmic.
  • If C is chiasmic and a is some string, then aCa is also chiasmic. Note that this applies recursively, thus abCba is chiasmic if C is also chiasmic and a and b are non-empty strings.

For example, batbat is chiasmic, as are glassbottlebottleglass and AliceBobCharlieCharlieBobAlice. All even-length palindromes are chiasmic, being made up of many length-1 strings.

Note that the empty string is not a chiasmus.

The Challenge

We're programmers, so we like nice indentation. Your goal is to take chiasmic strings and indent them so that each matching substring is at the same level of indentation. For example, cheesepizzawithanchoviesanchovieswithpizzacheese would be indented like so:

cheese
    pizza
        with
            anchovies
            anchovies
        with
    pizza
cheese

For base case chiasms (i.e. 2 repetitions of a string), no indentation is necessary, but the substrings should still be on separate lines. Thus, gumgum would be indented:

gum
gum

In order for there to be only one canonical output for each chiasmus, if it is possible to indent at more than one place, indent in a way such that the a substrings for the form aCa are as long as possible (applied recursively for each C until the aa base case is reached). For example, catdogcatdogdogcatdogcat should be indented like this:

catdogcat
    dog
    dog
catdogcat

Not like this:

cat
    dog
        cat
            dog
            dog
        cat
    dog
cat

Also not like this:

cat
    dogcatdog
    dogcatdog
cat

The behavior of indenting a non-chiasmus is undefined.

Rules

  • Indentation can use any amount of whitespace of any kind, so long as it is consistent (e.g. do not mix tabs and spaces). Lines may either be output as a list/array/whatever or a newline-separated string.
  • You may assume that the input is a chiasmus that contains only alphanumeric characters.
  • As this is , the shortest submission wins.
| |
\$\endgroup\$
  • \$\begingroup\$ May indentation be done with a \t character? \$\endgroup\$ – Kamil Drakari Feb 9 '18 at 22:25
  • \$\begingroup\$ I probably should do that since it saves 2 characters and is purely cosmetic. \$\endgroup\$ – Beefster Feb 9 '18 at 22:43
  • \$\begingroup\$ "Longest possible substrings" still leaves some room for ambiguity. What's the canonical output for ababbaba? \$\endgroup\$ – Nitrodon Feb 10 '18 at 4:40
  • \$\begingroup\$ aba b b aba. I see how it can be indented as a bab bab a, though. \$\endgroup\$ – Beefster Feb 10 '18 at 6:44
  • \$\begingroup\$ I kept waiting for a glassbottlebottleglass test case! \$\endgroup\$ – Shaggy Feb 11 '18 at 9:27
  • \$\begingroup\$ @Shaggy Wish granted. \$\endgroup\$ – Beefster Feb 11 '18 at 16:52
  • \$\begingroup\$ I don't understand the catdogcatdogdogcatdogcat example. It seems to me to directly contradict the rule it's supposed to be illustrating. \$\endgroup\$ – Peter Taylor Feb 12 '18 at 8:54
  • \$\begingroup\$ @PeterTaylor how so? \$\endgroup\$ – Beefster Feb 12 '18 at 20:15
  • \$\begingroup\$ On review, I agree that "directly contradict" is overstating it. But the minimalist indentation still doesn't fit the rest of the question. The stated grammar is pointless: the derivation aCa is only permitted for extremely limited values of C (strings of the form bb such that there aren't c and d satisfying ab = cd and |c| > |a|). The statement "indent in such a way that the lowest levels of indentation have the longest strings possible" (my emphasis) makes no sense, because there is at most one level of indentation (or two if you count "unindented" as the first). \$\endgroup\$ – Peter Taylor Feb 12 '18 at 21:49
  • \$\begingroup\$ And the statement "All even-length palindromes are chiasmic, being made up of many length-1 strings" is not true, because the canonicalisation forces it to be made up of one repeated length-1 string and an outer layer of a repeated length-(n-2)/2 string. \$\endgroup\$ – Peter Taylor Feb 12 '18 at 21:50
  • \$\begingroup\$ The aCa form is recursive. Maybe I should make that clearer with the examples. \$\endgroup\$ – Beefster Feb 13 '18 at 1:53
  • 1
    \$\begingroup\$ I would suggest dropping the requirement to produce an error on non-chiasmal(?) input, and instead just guarantee that the input will be a chiasmus. This changes it from two challenges (detect whether the input is a chiasmus, and then indent it if it is) to one (indent a chiasmus). Just my opinion though. \$\endgroup\$ – Nathaniel Feb 13 '18 at 7:56
  • 1
    \$\begingroup\$ Slightly related \$\endgroup\$ – Shaggy Feb 13 '18 at 10:16
  • \$\begingroup\$ @Shaggy Well yeah it's related. I created that challenge and it was a direct inspiration for this one. \$\endgroup\$ – Beefster Feb 13 '18 at 19:30
0
\$\begingroup\$

Self-removing executable (retracted: dupe)

| |
\$\endgroup\$
  • \$\begingroup\$ I don't like the restriction, it makes it easier for you to test (I guess that's the point of it?), but it prevents me (and many others) from competing. Saying it must handle "long and unusual characters" is underspecified. You can say that the program must be able to handle any valid filename, in the chosen operating system. The example code is already very short, so it doesn't leave much room for golfing, with all the restrictions in place. \$\endgroup\$ – Stewie Griffin Feb 14 '18 at 11:03
  • \$\begingroup\$ Which restriction? Shall it be centered around per-language leaderboard then? \$\endgroup\$ – Vi. Feb 14 '18 at 11:13
  • \$\begingroup\$ Always per-language. I guess t's not all restrictions, but all the Linux-specific stuff. Keep in mind that these are only my opinions though, others might disagree. \$\endgroup\$ – Stewie Griffin Feb 14 '18 at 11:22
  • \$\begingroup\$ It could be a good idea to have it Linux specific, but the example code is already so short that it leaves very little room for creativity. \$\endgroup\$ – Stewie Griffin Feb 14 '18 at 11:23
  • 1
    \$\begingroup\$ Dupe: codegolf.stackexchange.com/questions/19355/… ? \$\endgroup\$ – user202729 Feb 14 '18 at 12:52
0
\$\begingroup\$

Convert a number to (Name-To-Be-Specified)

(Name-To-Be-Specified) is a completely made up language. It uses a Senary (base 6) system of numbers with words for those numbers structured in a similar way to English.

0 to 6
Single digit numbers use a single word for each digit.

0 = "zeeroo"
1 = "nimbo"
2 = "feta"
3 = "tarumba"
4 = "ntamno"
5 = "waramaka"
(Any similarity to Kómnzo numbers are coincidental.)

6 to 11
The first set of two-digits numbers have special rules.

6 = "wi"
7 = "seeveen"
8 = "ayte"
9 = "tarumbawin"
10 = "ntamnowin"
11 = "waramakawin"

12 to 35
Multiples of 6 have the single digit word with a "wee" suffix.

12 = "fetawee"
18 = "tarambawee"
24 = "ntamnowee"
30 = "waramakawee"

Other numbers in this range are made by joining the word for the multiple of 6 with the word for single digit number, separated by a space. For example:
13 = "fetawee nimbo"
20 = "tarambawee feta"
27 = "ntamnowee taramba"
34 = "waramakawee ntamno"

36 to 1295
1296 to 46655
46656 to 1679615
1679616 to 60466175
(Since this is a sandbox, I'll leave these to-be-specified for now. Suffice to say I'll come up with words for each and consistent rules for joining them together and when you need the word "and".)

Challenge

Write a program that takes an integer as input and outputs that number in (Name-To-Be-Specified) words as described above. Shortest code wins.

| |
\$\endgroup\$
  • \$\begingroup\$ A language called Golfish already exists >_< \$\endgroup\$ – Mr. Xcoder Feb 23 '18 at 13:50
  • \$\begingroup\$ @Mr.Xcoder I believe you mean Gol><> \$\endgroup\$ – Mego Feb 23 '18 at 13:52
  • \$\begingroup\$ That's a programming language, not a spoken language. But fair point, if I graduate this to an actual question I'll pick a new name. \$\endgroup\$ – billpg Feb 23 '18 at 13:52
  • \$\begingroup\$ @Mego Well yeah but the repository name is Golfish... \$\endgroup\$ – Mr. Xcoder Feb 23 '18 at 13:53
  • \$\begingroup\$ Anyway, I'd advise referencing that you're not referring to Gol><> in any way. :) \$\endgroup\$ – Erik the Outgolfer Feb 23 '18 at 13:54
0
\$\begingroup\$

Paintball Tournament

Inspired by The Rock, Paper, Scissors, Lizard, Spock Tournament of Epicness as well as other King-of-the-hill challenges, I would like to propose a Paintball Tournament.

There is a game on my phone, called Game Pigeon that contains a paintball game. This paintball game is played by two players. The object of the game is to shoot your opponent x times before they shoot you x times.

Gameplay

The game is played in two sets of rounds. A moving round and a shooting round.

Both players, without their opponents knowledge, pick from three objects in front of them to hide behind.

                                (P1) X           X
                                     X           X (P2)
                                     X           X

Both players, without their opponents knowledge, choose which target across from them they would like to shoot at. After players decide which target to shoot at, players shoot at the targets chosen in unison, during which expose themselves from behind their target and are vulnerable to be hit.

Let's go through a small example. In the movement round, P1 has chosen to hide behind their left-most target. P2 has chosen to hide behind their middle target. In the shooting round, P1 chooses their leftmost target (Spot 1). P2 chooses their rightmost target (Spot 3). (See Below for diagram)

                                (P1) 3 <- Hit   1
                                     2          2 (P2)
                                     1  Miss -> 3      

For the above example, P1 would miss their shot and P2 would hit their shot, resulting in P1 losing one of their lives. During the shooting phase, players must choose a barrier to shoot behind, they cannot stay hidden.

After the shooting phase both players go back into the moving phase and, without their opponents knowledge, can move behind either of the other two objects or stay in place. They then continue to the shooting phase. They loop through these two phases until one of the players run out of lives, both players run out of lives, or a set number of rounds is completed.

Inputs

In the first game of the match, no arguments will be supplied to your bot. In each subsequent game of the match, you will be supplied 2 Args. -Arg1 will contain the location of the player([1, 2, or 3]) as well as the players move history. -Arg2 will contain the location of the players shot([1, 2, or 3]) as well as the players shot history. Both of these locations are referenced as if you are looking in the face of your opponent.

Example:

  • Round 1: PaintballBot.exe
  • Round 2: PaintballBot.exe 1 1
  • Round 3: PaintballBot.exe 12 11
  • Round 4: PaintballBot.exe 121 113

Output

Each round, your bot must output the location in which it is hiding, and the location it is going to shoot, to STDOUT, with two characters. All example outputs are shown below:

11 12 13 21 22 23 31 32 33

Match Format

Each submitted bot will play one match against each other bot in the tournament

Each match will last until one of the players loses their x amount of lives, or the match executes 50 rounds.

Matches will be played anonymously, you will not have an advanced knowledge of the specific bot you are playing against, however you may use any and all information you can garner from his decision making during the history of the current match to alter your strategy against your opponent. You may also track history of your previous games to build up patterns/heuristics etc... (See rules below)

Submission

Your submission should include:

  • Your Bot's name
  • Your Code
  • A command to
    • execute your bot from the shell e.g.
    • ruby myBot.rb
    • python3 myBot.py
    • OR
    • first compile your both and then execute it. e.g.
    • csc.exe MyBot.cs
    • MyBot.exe

Sidenotes

  • Need to describe that the location is relative to the shooter(from left to right) and the targets are relative to the shooter(from left to right)

  • I am still working on the control program for this event, and any help from other is greatly appreciated

If someone with more experience than me wants to take this over, please let me know. I would rather help with this challenge since it is my first and then have the knowledge and skills to run my own in the future.

Please let me know what still needs more clarification so we can have a fun tournament!

| |
\$\endgroup\$
0
\$\begingroup\$

Sandbox Notes

  • Is this inflammatory, mean, and liable to draw unwanted and unnecessary attention to low-voted questions in the Network?
  • Better tags?
  • I should probably write a snippet to find all angry Metas.

Angry Meta

A site on the Stack Exchange network is considered to have an angry Meta if the lowest-voted Meta question (possibly closed, but not deleted) on the site is voted lower than the lowest-voted Main question.

For example, at the moment, the lowest-voted question on PPCG.SE is at -32, while the lowest-voted question on Meta.PPCG.SE is at -24. This means that codegolf does not have an angry Meta.

On the other hand, the lowest voted question on SoftwareEngineering.SE is at -13, while the lowest-voted question on Meta.SoftwareEngineering.SE is at -17. This means that softwareengineering does have an angry Meta.

Challenge

You will be given the name of a Stack Exchange site, which you can assume will not be Area 51, Stack Apps, Stack Overflow, a subdomain of Stack Overflow (such as the Spanish Stack Overflow), Ask Ubuntu, Super User, Meta.SE, or any other site that whose domain is not of the form *.stackexchange.com.

The name will be given as the name of the subdomain (e.g. codegolf for PPCG, puzzling for Puzzling, gaming for Arqade, etc.). You should return one of two distinct, consistent values depending on whether the site has an angry Meta or not.

Since this is liable to change over time, I will not provide a list of test cases here, but you can use this Stack Snippet which is the reference implementation:

TODO

| |
\$\endgroup\$
  • \$\begingroup\$ I suppose you mean to say lowest voted questions in your PPCG.SE example. \$\endgroup\$ – Weijun Zhou Mar 1 '18 at 13:12
  • \$\begingroup\$ @WeijunZhou Fixed. \$\endgroup\$ – Esolanging Fruit Mar 1 '18 at 16:38
0
\$\begingroup\$

Comment or not comment?

Write a function which given an all lowercase string, return the same string but with characters that are comments turned uppercase.

Input

Input is a null terminated ASCII string which may contain any of these characters abcdefghijklmnopqrstuvwxyz /*\ space newline
Last and only last character is null
You will not need to test for invalid input, such as "stringliterals" etc

Rules for what is comment

/* causes everything until */ (or end of string) to be comment
// causes everything until newline (or end of string) to be comment
'\' at end of line in a comment causes next line to be a comment aswell

Output

A copy of the input but with letters which are comments according to the rules above in uppercase, other characters shall remain unchanged

Examples

/comment -> /comment
//comment -> //COMMENT
/*comment -> /*COMMENT
no /*yes*/ no // yes -> no /*YES*/ no // YES

/*          ->              /*
comment                     COMMENT
*/                          */

//\          ->             //\
/*                          /*
not comment                 not comment
//\                         //\
*/                          */

ungolfed

| |
\$\endgroup\$
  • \$\begingroup\$ Which characters can be in the input? Printable ASCII? \$\endgroup\$ – user202729 Mar 4 '18 at 5:48
  • \$\begingroup\$ printable ascii yes and you can also assume input will not contain uppercase letters, function shall change a-z -> A-Z if they would be comment according to C-syntax \$\endgroup\$ – PrincePolka Mar 4 '18 at 16:52
  • \$\begingroup\$ I edited the proposal, clarified and simplified a little bit \$\endgroup\$ – PrincePolka Mar 4 '18 at 20:59
  • \$\begingroup\$ Potential dupe. This challenge is about removing comments instead of changing their capitalization, but the main part is the same. \$\endgroup\$ – Laikoni Mar 6 '18 at 21:00
  • \$\begingroup\$ @Laikoni, thanks I had not seen that one, looks almost the same \$\endgroup\$ – PrincePolka Mar 6 '18 at 21:21
0
\$\begingroup\$

There, I fixed it (with recycled parts)

Challenge

Given a string containing only letters a-z (either upper- or lowercase), fix it by adding characters to it so that the difference between two adjacent characters is no more than one, or if you can't, remove offending characters (in order) until the string satisfies the requirement.

For example, abcdfge must be fixed either by adding an e, resulting in abcdefge, or by removing f and g, resulting in abcde. Removing must be done only if adding can't be done.

You can add characters only from a recycle bin, which your program or function must store between calls. Characters removed from the string are placed in the recycle bin, and added characters are removed from the bin. The bin can store multiple instances of the same character. In the beginning, the bin is empty.

If you can't fix the whole string by adding characters, don't add any characters. That is, only ever either add or cut a string, not a bit of both.

Example

First call:
  Recycle bin: "" (empty)
  Input:       "abcdfge"
  Output:      "abcde"          // 'f' and 'g' are removed and placed in the recycle bin

Second call:
  Recycle bin: "fg"
  Input:       "defhiabcdeg"
  Output:      "defghiabcdefg"  // 'f' and 'g' are taken from the recycle bin and placed
                                // where they are needed.

Third call:
  Recycle bin: ""
  Input:       "codegolf"
  Output:      "cdef"           // The two 'o's and the 'g' and the 'l' are removed and
                                // placed in the recycle bin.

Fourth call:
  Recycle bin: "oogl"
  Input:       "mnpqrt"
  Output:      "mn"             // 'o' could be added, but it isn't, because an 's' is
                                // also missing and we don't have one. "pqrt" are added
                                // to the recycle bin.

Fifth call:
  Recycle bin: "ooglpqrt"
  Input:       "kmnrsu"
  Output:      "klmnopqrstu"    // Characters "lopqt" are added from the bin to fill all
                                // the gaps. Unused characters are left in the bin.

Sixth call:
  Recycle bin: "ogr"
  Input:       "qwerty"
  Output:      "qe"             // The gap between 'q' and 'w' can't be fixed so 'q' is
                                // removed. 'e'-'q' < 0 and therefore not more than 1,
                                // so 'e' stays. The rest of the characters are removed.
                                // The recycly bin will contain "ogrwrty".

This is , so the goal is to make your code as short as possible in whatever language you choose to participate with.

| |
\$\endgroup\$
  • 2
    \$\begingroup\$ "You can add characters only from a recycle bin, which your program or function must store between calls." Many languages don't have the capability to store information between program runs or function calls, or at least not easily. Perhaps having two inputs (recycle bin, 'input'), and two outputs (recycle bin, 'output') would be more inclusive? \$\endgroup\$ – Οurous Mar 9 '18 at 9:32
0
\$\begingroup\$

I wrote the following question then found this question. Is it similar enough to mine that mine would be considered a duplicate?

Recursive Prime Multiplicative Base

I've been thinking about this idea for months now, and, as far as I have been able to find, nobody else has thought of it. Please let me know if I wasn't the first!

Most number systems are additive positional. These take the form of ∑bi*di, where di is the sequence of digits and bi is the base sequence. For example, for the number 1234 in base ten, di={4,3,2,1,0,0,0...} and bi=10i.

I propose the idea of a multiplicative positional system.1 This instead takes a general form of ∏bidi. The most obvious useful multiplicative base is that of bi=Pi, where Pi is the i-th prime number. For example, one could write 3960 as 3,2,1,0,12, as 23*32*51*70*111=3960. This is mathematically interesting (e.g. multiplication gets reduced to addition, but addition is way harder) but we're still using an additive system underneath. This obviously cannot do. Thankfully, we can use recursion! This is probably best illustrated with an example:

3960=
  3    2   1  0 1
(0 1) (1)  () 0 ()
(0()) (()) () 0 ()
=(0())(())()0()

As you can see, each nonzero digit gets replaced with that digit's representation. 1 gets replaced with (), as a blank sequence is equivalent to an infinite series of zeros, and anything to the power of zero is one. If one were to include a symbol representing negation, one could write any rational number and even any expression obtainable from the integers using a finite number of multiplications and exponentiations in a finite sequence of four characters.

To give this number system a name, I term it the recursive prime multiplicative base or RPMB (unless you have any better ideas for it).

1Extending this, one can conceive of an infinite number of hyperoperational positional systems, but that's for another code challenge. ;)

The Challenge

You are to write a program that, when given an integer as input outputs the RPMB form of that integer. The output may be either as a string or a list. If the output is a string, you may substitute any characters for ()0. If the output is a list, the output should be a list of 0's and other lists matching this description. For example, for 3960, the program might output [[0,[]],[[]],[],0,[]].

Examples

(todo)

Scoring

This is , so the smallest program in bytes wins.

| |
\$\endgroup\$
  • \$\begingroup\$ Related. \$\endgroup\$ – user202729 Mar 11 '18 at 10:07
  • \$\begingroup\$ But 9 isn't a prime... \$\endgroup\$ – user202729 Mar 11 '18 at 10:08
  • \$\begingroup\$ @user202729 whoops, typo! Thanks for catching that \$\endgroup\$ – DanTheMan Mar 11 '18 at 17:30
0
\$\begingroup\$

If replacing all the '3's doesn't fix your code, remove the 4s, too, with 'ceiling(pi) / floor(pi) * pi * r^floor(pi)'. Mmm, floor pie.

  • Output the largest prime number possible in as few bytes as possible using no number but pi.
  • This code will be the sole judge of whether your output is actually a prime number.
  • Your score will be the prime number produced divided by the number of bytes used for your code.
  • If your language has a built-in variable for pi, use that. Otherwise, let pi equal 3.1415926535898. Any occurrance of pi itself or something referring directly to pi counts as one byte.
  • Your number must be generated solely by applying various operations and functions to pi. Those functions cannot offset pi by anything other than another number derived from pi. The sole exceptions to this rule are floor and ceiling functions. For example, if you want to find the square root of something, you must do something to the effect of raising it to the (pi/pi/(pi/pi+pi/pi))th power.
  • You may not modify pi in any way that uses a reference to or directly uses non-pi number.
  • The entirety of the number must be outputted in base 10 and without scientific notation. All digits of the number must be included in the output.
  • You must provide a
  • The largest score wins.

Here's an example in Lua:

print(math.floor(math.pi))

That's 14 bytes (counting math.pi as one byte) for the prime number 3, so my score is 3/14 or ~0.21428571428. Here's another example:

m=math print(m.floor(m.pi^m.pi)+m.pi/m.pi)

That's 31 bytes (each m.pi is one byte) for the prime number 37, so my score is 37/31 or ~1.1935483871.

Sandbox

Are there any other ways to clear up ambiguities I may be missing?

| |
\$\endgroup\$
  • \$\begingroup\$ some loopholes are forbidden by default and are sometimes referred to as "standard loopholes". \$\endgroup\$ – Giuseppe Mar 12 '18 at 21:31
  • \$\begingroup\$ You should include a winning criterion, i.e., "largest score wins" if I'm reading this correctly. \$\endgroup\$ – Giuseppe Mar 12 '18 at 21:31
  • \$\begingroup\$ @Giuseppe Thanks. I've edited the post \$\endgroup\$ – Zenon Mar 12 '18 at 21:33
  • \$\begingroup\$ At some point (and judging by the kind of stuff that happens here) the values being produced will be beyond guaranteed bounds of even strong tests like Baillie-PSW (2^64=18446744073709551616). Are such values banned or is it up to others to show that the number produced is composite? For example I might post Ç*ǵḞ+Ḟ×Ḟ+Ċ*`$ in Jelly since it produces 10555134955777783414078330085995832946127396083370199445109 which Baillie-PSW says is a probable prime. \$\endgroup\$ – Jonathan Allan Mar 12 '18 at 21:55
  • 1
    \$\begingroup\$ Welcome to PPCG! Nice challenge! \$\endgroup\$ – Weijun Zhou Mar 12 '18 at 22:19
  • \$\begingroup\$ Oh, by the way, that is floor(π^π)×(floor(π^π)+floor(π^π))+ceil(π^π)^ceil(π^π) and WolframAlpha also says it is prime \$\endgroup\$ – Jonathan Allan Mar 12 '18 at 22:24
  • \$\begingroup\$ ...Mathematica to the rescue, it has a "PrimalityProving" package which we can plug numbers into to check Try It Online! Might be worth including this link. \$\endgroup\$ – Jonathan Allan Mar 12 '18 at 23:36
  • \$\begingroup\$ Note that requiring unobservable behavior is discouraged. I suggest making the challenge a mathematical challenge and the score is calculated based on (the size of the formula) and (the output). (yes, non-code challenges are allowed) \$\endgroup\$ – user202729 Mar 13 '18 at 1:43
  • \$\begingroup\$ Quoting from that answer: "Non-observable requirements tend to be vague, subjective, or based on false assumptions about the properties of programming languages." -- Yes, you're assuming that every language have floating point support, or that every language have the functions you mentioned. \$\endgroup\$ – user202729 Mar 13 '18 at 1:48
  • 4
    \$\begingroup\$ (1) It's very hard to write prohibitions unambiguously, and I don't think you've succeeded. I don't know what exactly "Your number must be generated solely by applying various operations and functions to pi. Those functions cannot offset pi by anything other than another number derived from pi." allows and forbids. Can I convert pi to a string and take its length? Convert pi to a string, remove the decimal point, and convert back to an integer? Note: answering those two examples would not address the real problem. (2) "You must provide a" what? \$\endgroup\$ – Peter Taylor Mar 13 '18 at 8:55
  • \$\begingroup\$ I fell it's a busy-beaver \$\endgroup\$ – l4m2 Mar 15 '18 at 15:14
0
\$\begingroup\$

Relay Adder

Make a 32-bit full adder with relays.

A relay is here a gate with four inputs A, B, C and D, and output if A==B then C else D.

You'll be given two 32-bit numbers (totally 64 inputs), a carry flag, constant 0 and 1, sum up to 67 inputs; output 33 bits as the result

Smallest Gate count * gate depth win

TODO: add tags

| |
\$\endgroup\$
  • 1
    \$\begingroup\$ Do you foresee any possible gains by making this a 32-bit adder? It feels to me like an 8-bit adder would be sufficiently complicated to allow golfing, without becoming as tedious. What do you mean by: "sup up to 67 inputs?" You also don't define what gate depth is. You also probably want to come up with a way for answers to post readable solutions. \$\endgroup\$ – FryAmTheEggman Mar 16 '18 at 20:20
0
\$\begingroup\$

Split the wagons!

In some variants of APL, a tacit function, or a train, consists of several functions next to each other. Your task is, given a train, to separate the different functions it consists of.

The symbols you will be given and their meanings are:

  • F: Function
  • O: Dyadic operator

Here is how functions are separated in extended Backus-Naur form:

function ::= {F O} F

Namely, a dyadic operator O accepts one function to its left and one F to its right, and the result is one function, for example F O F, F O F O F O F and F O F O F O F O F O F are all considered single functions for the purposes of this challenge. F F F O F O F F F O F, however, isn't a single function, and is split as (F, F, F O F O F, F, F O F).

You can get the symbols in any reasonable form, including a string, an array of integers, and any other kind of ordered collection able to hold at least 2 different elements. You can assume the input doesn't start or end with O, or contain two Os in a row. However, you must always use the same symbols, and you must only use two unique symbols. The output can be one of:

  • List of indices (0- or 1-based) which are the locations of the first symbol of each function. The index representing the first symbol of the input can be optionally omitted, as it's implied. The list doesn't have to be ordered.
  • List of indices (0- or 1-based) which are the locations of the last symbol of each function. The index representing the last symbol of the input can be optionally omitted, as it's implied. The list doesn't have to be ordered.
  • List of the individual functions. Every element of this list is a list subject to the same restrictions as the input, but not necessarily in the same format as the input. However, all elements must have the same format. The list has to be ordered.

Do not include empty partitions or duplicate, out-of-bounds or negative indices in the output.

Below are some test cases. F and O are used for F and O respectively, and the output is a list of the separated parts.

(empty) -> (empty)
F -> F
FOF -> FOF
FOFOFOF -> FOFOFOF
FOFOFOFOFOF -> FOFOFOFOFOF
FFFOFOFFFOF -> F F FOFOF F FOF
FFOFOFFOF -> F FOFOF FOF
FFFFF -> F F F F F
FOFF -> FOF F
FFFF -> F F F F
| |
\$\endgroup\$
0
\$\begingroup\$

Ungolf my tinylisp code

I like golfing in tinylisp:

(d M(q((x)(i x(i(disp x)0(M x))0

But I also like posting explanations with nicely formatted code:

(d M
 (q
  ((x)
   (i x
    (i (disp x) 0 (M x))
    0))))

Can you help me generate the ungolfed code for my explanations?

The task

Given a line of tinylisp code, return or output the same code, formatted to the following specifications:

Input syntax

Tokens in tinylisp are (, ), or any string of one or more printable ASCII characters excluding parentheses or space. (I.e. the following regex: [()]|[^() ]+.) A non-parenthesis token is called an atom. Spaces are ignored, except insofar as they separate tokens.

For this challenge, the input code will consist of a single parenthesized list containing 0 or more items. The items in the list may be either (arbitrarily deeply nested) lists or single-token atoms (or a mixture). There may be spaces between items; spaces may also be omitted if they are not necessary to separate two adjacent atoms. Closing parentheses at the end of the expression may be omitted.

Some examples:

()
(1 2 3)
(1 2 3
(1 (2)
(1(2
(1((2))3
(((((xyz)))))
(((((

Bare atoms, like xyz, do not have to be handled for this challenge.

Nesting levels

We define a nesting level for a tinylisp expression as follows:

  • Atoms and the empty list () have a nesting level of 0.
  • A nonempty list has nesting level N+1, where N is the maximum nesting level of its items.

Some examples:

Expression   Nesting level
()           0
(1 2 3)      1
(1 2 ())     1
(1 (2))      2
(1 ((2)) 3)  3
((((()))))   4

How to ungolf

To ungolf a tinylisp expression, first supply any missing closing parentheses. Then, add newlines and whitespace according to the following rules:

  • For an expression of nesting level 0, do not add any whitespace.
  • For a list of nesting level 1 or 2, make sure the elements of the list are separated by a single space.
  • Lists of nesting level 3 or higher must be broken across multiple lines:
    • The first element of the list should be on the same line as the opening parenthesis, with no whitespace in between.
      • More specifically, the first element should begin on the same line. If the first item itself has nesting level 3 or higher, it will of course be spread over multiple lines itself.
    • IF the second element of the list has nesting level 0 or 1, place it on the same line as the first, with a space in between; otherwise, if its nesting level is 2 or higher, place it on its own line.
    • The third and subsequent elements of the list must each be on their own line.
  • Elements on their own line must be indented by a number of spaces equal to how deeply they are nested in the expression. The top-level list should be indented 0 spaces, its elements 1 space, their elements 2 spaces, etc.
  • Closing parentheses always go with the preceding list.

A worked example

Suppose this is our input:

(d E(q((n)(i(l n 2)(s 1 n)(E(s n 2

First, supply missing close-parens:

(d E(q((n)(i(l n 2)(s 1 n)(E(s n 2))))))

The outermost list has nesting level 6, so it must be split over multiple lines. Its second element is E (nesting level 0), so we keep that on the same line. We place the third element on its own line, indented by one space.

(d E
 (q((n)(i(l n 2)(s 1 n)(E(s n 2))))))

The next list has nesting level 5. Its second element has nesting level 4, so it goes on its own line, indented by two spaces.

(d E
 (q
  ((n)(i(l n 2)(s 1 n)(E(s n 2))))))

The next list has nesting level 4. Its second element has nesting level 3, so it goes on its own line, indented by three spaces.

(d E
 (q
  ((n)
   (i(l n 2)(s 1 n)(E(s n 2))))))

The next list has nesting level 3. Its second element has nesting level 1, so it goes on the same line as the first element, separated by a space. We place the third and fourth elements on their own lines, indented by four spaces.

(d E
 (q
  ((n)
   (i (l n 2)
    (s 1 n)
    (E(s n 2))))))

The list (s 1 n) has nesting level 1 and thus goes on one line. It has spaces between its elements, so it is already ungolfed.

The list (E(s n 2)) has nesting level 2 and thus goes on one line. It needs spaces between its elements.

Final result:

(d E
 (q
  ((n)
   (i (l n 2)
    (s 1 n)
    (E (s n 2))))))

Submission requirements

The input will always be a single (possibly nested) list. Thus, it will always start with (, never an atom. The number of opening parentheses will be greater than or equal to the number of closing parentheses. The input will not have any leading or trailing whitespace. The input will consist only of printable ASCII characters; in particular, it will not contain newlines or tabs.

Your solution may be a program or function. You may use any of the default I/O methods.

Input must be a string, a list of characters, or the nearest equivalent in your language.

Output may be a multiline string or a list of strings. It may optionally contain trailing spaces and/or a single trailing newline.

Examples

()
=>
()

(load library
=>
(load library)

(q(1 2
=>
(q (1 2))

(q((1)(2
=>
(q
 ((1) (2)))

(((((
=>
((((()))))

(d C(q((Q V)(i Q(i(l Q 0)0(i V(a(C(s Q(h V))V)(C Q(t V)))0))1
=>
(d C
 (q
  ((Q V)
   (i Q
    (i (l Q 0)
     0
     (i V
      (a
       (C
        (s Q (h V))
        V)
       (C Q (t V)))
      0))
    1))))

((q (g (c (c (q q) g) (c (c (q q) g) ())))) (q (g (c (c (q q) g) (c (c (q q) g) ())))))
=>
((q
  (g
   (c
    (c (q q) g)
    (c
     (c (q q) g)
     ()))))
 (q
  (g
   (c
    (c (q q) g)
    (c
     (c (q q) g)
     ())))))

(d f(q((x y z p)(i p(i(l p 0)(f(s x p)y(a z p)0)(i x(f(s x 1)(a y 1)z(s p 1))(i y(f x(s y 1)(a z 1)(s p 1))(f x y z 0))))(c x(c y(c z(
=>
(d f
 (q
  ((x y z p)
   (i p
    (i (l p 0)
     (f (s x p) y (a z p) 0)
     (i x
      (f (s x 1) (a y 1) z (s p 1))
      (i y
       (f x (s y 1) (a z 1) (s p 1))
       (f x y z 0))))
    (c x
     (c y (c z ())))))))

(def even? (lambda (num) (divides? 2 num)))
=>
(def even?
 (lambda (num) (divides? 2 num)))

(def odd? (lambda (num) (not (divides? 2 num))))
=>
(def odd?
 (lambda (num)
  (not (divides? 2 num))))

(def divides? (lambda (divisor multiple) (if (negative? divisor) (divides? (neg divisor) multiple) (if (negative? multiple) (divides? divisor (neg multiple)) (if (less? multiple divisor) (zero? multiple) (divides? divisor (sub2 multiple divisor)))))))
=>
(def divides?
 (lambda (divisor multiple)
  (if (negative? divisor)
   (divides? (neg divisor) multiple)
   (if (negative? multiple)
    (divides? divisor (neg multiple))
    (if (less? multiple divisor)
     (zero? multiple)
     (divides? divisor (sub2 multiple divisor)))))))

Reference solution

Here's a reference solution in Python 3: Try it online!

Similar questions

I haven't found an exact duplicate yet. The closest is:

but there are many significant differences between that question and this: input on multiple lines vs. one line; different criteria for when to insert newlines; having to add missing close-parens; having to handle (), etc.

Other related questions:

Sandbox questions

  • Is the TIO link enough for the reference solution, or should I put the code in the actual post?
  • Is there any existing question that's close enough to be a duplicate?
  • Which makes a better challenge: 1) input is a single expression on a single line, or 2) input is one or more expressions, each on its own line? #1 is the way it's currently written, and makes the challenge simpler; #2 would be more generally useful.
| |
\$\endgroup\$
0
\$\begingroup\$

The Challenge

The goal is to write a complete program that prints out every possible tetris block made up of #.

The blocks must have an equal chance of printing in any order and must appear exactly once each. The blocks may have any rotation, rotation may be consistent between executions. No two blocks can be touching. All blocks must have settled on the "floor".

ValidExample.exe
                    #   #
## ###      ##   ## #   #
##  #  ####  ## ##  ## ##

TouchingExample.exe
      #
      #  # ##
## ####  #  # ##   ## 
##  # # ##  #  ## ##   

FloatingExample.exe
       #   #             
## ### ## ## #     # ####
##  #   # #  ### ###     

Use the language of your choice, lowest number of bytes wins

Questions

  • Is the wording clear enough?
  • Does the challenge meet the expectations for a challenge here?
  • What can I do to remove any ambiguity if there is any?
  • Is the formatting for the question / examples ok?
  • Would the challenge be "better" if the blocks had to be made up of their corresponding letter (IOJLZST)
| |
\$\endgroup\$
  • \$\begingroup\$ This could be a dupe of codegolf.stackexchange.com/questions/2223/polyomino-generator \$\endgroup\$ – Sok Mar 21 '18 at 9:22
  • \$\begingroup\$ @someone is the new wording better? Replaced random order with a requirement that each order have equal odds. \$\endgroup\$ – Southpaw Mar 21 '18 at 10:02
  • 1
    \$\begingroup\$ I think it is. I don't think the blocks-made-of-letters is a good idea. \$\endgroup\$ – my pronoun is monicareinstate Mar 21 '18 at 10:04
  • \$\begingroup\$ @Sok No input, random order, only tetrominos, no floating restriction. Those seem to be the main differences. Are they enough to distinguish it? \$\endgroup\$ – Southpaw Mar 21 '18 at 10:05
0
\$\begingroup\$

Euler's Formula for the Quaternions

Euler's famous formula, e^iθ = cosθ + isinθ, can be used to calculate the exponential of arbitrary complex numbers: e^(a+ib) = e^a(cosb + isinb). That's cool and all, but what if we want to go even further?

The quaternions are an expansion of the complex numbers, where instead of just having i*i = -1, you have i*i = j*j = k*k = i*j*k = -1. Quaternions can be represented as a + bi + cj + dk or (s, v) where s is a scalar and v is a 3-Dimensional vector.

Euler's formula can be extended to the quaternions; for an arbitrary quaternion q = (s, v), e^q = e^s (cos|v|, (v/|v|)sin|v|), or, if q = a + bi + cj + dk and r = sqrt(b^2 + c^2 + d^2), e^q = e^a (cosr + (bi + cj + dk)(sinr)/r).

The task:

Write a program or function to exponentiate arbitrary quaternions. Built-ins are allowed. You may represent a quaternion in any sane manner.

Examples

Here, quaternions are represented as a four element array.

Input                                    Output (approximately)
0 3.14159 0 0                            -1
0 1 1 1                                  -0.160557 0.56986 0.56986 0.56986
1 2 3 4                                  1.69392 -0.78956 -1.18434 -1.57912
0.095767 0.601479 0.285658 0.926716      0.458433 0.527339 0.250447 0.812487
-0.654682 -0.925557 -0.409382 0.619391   0.194782 -0.37576 -0.166202 0.251462
| |
\$\endgroup\$
  • 1
    \$\begingroup\$ There's a missing ) in e^q = e^a (cosr + (bi + cj + dk)(sinr)/r \$\endgroup\$ – Peter Taylor Mar 23 '18 at 21:53
0
\$\begingroup\$

Brainfuck Compiler!

Your goal is simple: Compile brainfuck to x86 assembly (NASM style), and do it with as small of a program as possible. You will be able to choose your compiler's input and output model, as long as the input is brainfuck code and the output is NASM style x86 assembly.

The brainfuck code should read from STDIN and output to STDOUT

Your compiler must be fully compliant with no extensions, and must support a infinite (to the max the computer's memory can sustain, running out of space on either end can be treated as a crash.) number of unsigned 8 bit cells both forward and back, with the tape Your output assembly should provide the exact same outputs for the corresponding inputs as the brainfuck code.

Your program's output must be compilable to a ELF binary that runs on Linux using the NASM compiler. Your program will be linked with libc, so you can use any function in the C library.

What is Brainfuck?

Brainfuck is a language with 8 instructions, and a tape memory model composed of an infinite amount of unsigned 8 bit (1 byte) cells. The pointer always points to one of those cells, executing its operations on the current cell. Each instruction is executed one at a time, and are as follows:

  • + Increment the current value under the pointer
  • - Decrement the current value under the pointer
  • . Output the value under the pointer as an ASCII character
  • , Get a character from input, and wait until one is received.
  • > Move the pointer to the right
  • < Move the pointer to the left
  • [ Jump to the matching ] if the value under the pointer is 0
  • ] Jump to the matching [ if the value under the pointer is not 0

If a [ doesn't have a matching ] (or vice versa), you can consider that undefined behavior.

Anything not listed here should be considered a NOP, or in the case of a empty program (EOF), simply a blank, noncrashing program.

Test cases.

To allow competition, and varying compilation results, my test cases will show what each test program should output.

Program:

"++++++++++[>+++++++>++++++++++>+++>+<<<<-]>++.>+.+++++++..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+.>."

Outputs (no input):

"Hello, World!"

Program:

+[,.]

Outputs:

"I am a test string" -> "I am a test string"

"Golfing is fun!" -> "Golfing is fun!"

Program:

`+[]`

Outputs:

Nothing. This program loops forever.

Program:

+[<+]

Outputs:

This program can be considered undefined behavior, because it will eventually run out of memory.

TODO

More test cases?

| |
\$\endgroup\$
  • \$\begingroup\$ is the tape left bounded? also you should specify input behaviour on EOF \$\endgroup\$ – Destructible Lemon Mar 26 '18 at 22:05
  • \$\begingroup\$ "to the max the computer's memory can sustain" -- I feel that requirement quite problematic. For example, a submission using 16-bit cell (and only use the lower 8-bit, for whatever reason) will only be able to handle half as many cells as one using 8-bit cell. \$\endgroup\$ – user202729 Mar 27 '18 at 0:55
  • \$\begingroup\$ @user202729 I'd say a submission like that would be rare enough it's a non issue. \$\endgroup\$ – moonheart08 Mar 27 '18 at 1:40
  • \$\begingroup\$ @DestructibleLemon The tape is unbounded, both left and right. \$\endgroup\$ – moonheart08 Mar 27 '18 at 1:40
  • \$\begingroup\$ For a doubly infinite tape, to the max the computer's memory can sustain definitely needs more clarification. For example, if I "run out of space" on the right end, but still have space on the left one, do I need to shift things around? \$\endgroup\$ – Dennis Mar 27 '18 at 1:42
  • \$\begingroup\$ Alright. I'll fix that now. \$\endgroup\$ – moonheart08 Mar 27 '18 at 1:43
  • \$\begingroup\$ I think it's better to use 1 side unbounded, as that's usually the convention i think \$\endgroup\$ – Destructible Lemon Mar 27 '18 at 2:02
0
\$\begingroup\$

Fill a virtual World Cup Sticker Album

As the World Cup is due to kick off (pun intended), the inevitable sticker book comes along as well.

According to this BBC article , at a cost of £0.80 for a pack of 5 and with a total of 682 stickers needed to complete the book it could cost up to £700 or more to fill, taking duplicates into account.

Write the shortest program possible to

  • Buy a virtual pack of stickers (at 0.80 per pack), which will be 5 random numbers between 1 and 682 (or 0 and 681)
  • Repeat until all numbers have been picked at least once
  • Output how many packs were bought and a final cost.

Output should be in the format "Bought number packets at cost of number"

Sample un-golfed Python 2 code

import random
total = 682
remain = total
cost = 0.8
spend = 0.0
packs = 0
got = [0 for i in range(total)]

while remain > 0:
    # buy a packet of stickers
    for i in range(5):
        got[random.randint(0,total-1)] += 1
    spend += cost
    remain = got.count(0)
    packs += 1

print 'Bought %d packs at cost of %.2f' % (packs,spend)

Sample output

Bought 865 packs at cost of 692.00

QUESTION

  • Writing the Python script for myself is what made me think of this question - does it help to include it, or clutter the page? (This is my first attempt at a question here)
| |
\$\endgroup\$
  • \$\begingroup\$ You need to flesh out what we're doing? Your code isn't super greatly commented and I'm not sure how much a pack costs, how many packs are needed. etc. should it always output the same amount? \$\endgroup\$ – Rɪᴋᴇʀ Mar 29 '18 at 20:57
  • \$\begingroup\$ What does "simulate" mean here? Beware the curse of the non-observable requirement. \$\endgroup\$ – Peter Taylor Mar 29 '18 at 22:28
0
\$\begingroup\$

Navigate my Taxi

Introduction

Taxi is an esoteric programming language simulating a taxi. You can pick up passengers (values) and drop them at special places to modify them. For example, this program squares the input. The places are all in Townsburg:

Map of Townsburg

To travel from one place to another, you have to tell your taxi where to go:

Go to the Post Office: west 1st left, 1st right, 1st left.

And you need gas to drive, your car gets 18 miles per gallon. So it's best to find the shortest possible way between two places. That leads me to ...

The Challenge

Input

You get an incomplete Taxi program, consisting of the following statements:

  • Pickup a[nother] passenger going to [the] <place>.: Pickup a passenger, you may ignore it for this challenge
  • "<string>" is waiting at [the] Writer's Depot. / <number> is waiting at [the] Starchild Numerology.: Create passengers, you may ignore this, too
  • Go to [the] <place>.: Go to a place, you have to add directions (see below)
  • [<label>]: A label for jumping, you have to parse those to know where the taxi is. They don't do anything if passed. You can assume that you are in the same location, regardless of where you reach the label from.
  • Switch to plan "<label>".: Unconditional jump, follow these to know where the taxi is
  • Switch to plan "<label>" if no one is waiting.: Conditional jump, you have to support both ways

If the input program contains anything else, you may do anything you want (undefined behaviour).

Conversion

Following all jumping instructions, you have to add directions to the Go to commands. It has to be the shortest possible way (I want to save gas!)

Directions consist of a cardinal direction (north, east, south, west or NESW) and a comma-separated list of turns, consisting of a number (1st 2nd 3rd or 1 2 3) and left/L or right/R.

Examples:

Go to the Post Office: west 1st left, 1st right, 1st left.
Go to Post Office: W 1 L, 1 R, 1 L.
Go to Tom's Trims: N.

The cardinal directions do have the following meanings (xstart means x pos of the starting point, yend means y pos of the next corner/intersection/place):

  • north: ystart > yend
  • south: ystart < yend
  • west: xstart > xend
  • east: xstart < xend

(Coordinates from the top left corner)

Here is a list of all intersections/corners/places/streets, extracted from the interpreter.

Some additional info:

  • The taxi starts at the Taxi Garage.
  • If the taxi reaches the Taxi Garage, the program ends.
  • If the program reaches its end and the taxi is not in the Taxi Garage, that's an error, so you'll have to add 'Go to the Taxi Garage: ...' at the end if it's missing.

Output

  • Your program or function has to output a valid Taxi program (online interpreter) or a list of instructions (which, when concatenated, form a valid Taxi program)
  • You may use the long (north 1st left) or short (N 1 L) syntax.
  • The ways chosen have to be the shortest possible (droven distance, i.e. sum of Euclidian distances between any two consecutive points on your way)
  • If there are multiple equally long ways, you can use any of them

Additional Rules

  • Standard loopholes are forbidden
  • Your score is the number of bytes in your program
  • Lowest score wins

Test Cases

TODO

  • Is any part of the specs confusing?
  • Should I not input a full program, but just start and destination?
  • Should I add the map in some format as an additional input?
| |
\$\endgroup\$
  • \$\begingroup\$ Thanks for using the sandbox, but I'm sorry that it's not very active. We decided that "typical desktop computer" is not clear enough, so you should change it. \$\endgroup\$ – user202729 Feb 24 '18 at 14:54
  • \$\begingroup\$ What is "shortest" measured in? Euclidean distance? What if there are multiple equally long paths? \$\endgroup\$ – user202729 Feb 24 '18 at 15:09
  • \$\begingroup\$ @user202729 Edit: time is now on TIO, distance is sum of Euclidian distances between any two consecutive points on the way. I'm thinking about writing a program that calculates the distance \$\endgroup\$ – wastl Feb 24 '18 at 16:37
  • \$\begingroup\$ TIO is still not usable for time-related things. See codegolf.meta.stackexchange.com/questions/12707/… . \$\endgroup\$ – user202729 Feb 24 '18 at 16:39
  • \$\begingroup\$ Is it guaranteed that the taxi will be in the same location regardless of how we reach a label? \$\endgroup\$ – Nitrodon Feb 24 '18 at 17:08
  • \$\begingroup\$ @user202729 Ok, removed time limit \$\endgroup\$ – wastl Feb 24 '18 at 17:09
  • \$\begingroup\$ @Nitrodon finally, I got what you meant. Sure. Although theoretically, if both points lie on one street, one could do that ... (I would not recommend it) \$\endgroup\$ – wastl Mar 16 '18 at 23:02
0
\$\begingroup\$

Left Turn at Euqreuqebla

Write a quine, according to the standard definition of a quine, that outputs itself when executed. However, when your code is reversed it should output each character of your source code separated by a newline instead.


Example

If your program was:

ABCDEFGH
IJKLMNOP

The unedited program should output:

ABCDEFGH
IJKLMNOP

However the reverse of the program should output:

A
B
C
D
E
F
G
H


I
J
K
L
M
N
O
P

Rules:

  • Outputting a single trailing or preceding newline is acceptable.
  • If your code contains newlines, they do not require rotation, treat them regularly.
  • Standard loopholes are disallowed.
  • Ensure that your "quine" is actually a quine.
  • This is , ; lowest byte-count wins.
| |
\$\endgroup\$
  • \$\begingroup\$ an example with code with newlines would be useful (as those I'd naturally rotate 90 degrees :p) \$\endgroup\$ – dzaima Mar 29 '18 at 21:04
  • \$\begingroup\$ @dzaima which way do you think is better, not requiring "natural rotation" to support Java and the like better? Or supporting natural rotation for the esolangs? \$\endgroup\$ – Magic Octopus Urn Mar 29 '18 at 21:07
  • \$\begingroup\$ a thing to consider is that if natural rotation would be required, everyone would just try to keep everything in a single line to make the challenge way easier \$\endgroup\$ – dzaima Mar 29 '18 at 21:10
  • \$\begingroup\$ @dzaima I could make it optional? I don't see that hurting the challenge too much either way to be honest, it just lets languages to what they do best. \$\endgroup\$ – Magic Octopus Urn Mar 29 '18 at 21:11
  • \$\begingroup\$ that'd be a good compromise if there's no better solution \$\endgroup\$ – dzaima Mar 29 '18 at 21:12
  • \$\begingroup\$ @dzaima ehhh? decent? \$\endgroup\$ – Magic Octopus Urn Mar 29 '18 at 21:17
  • \$\begingroup\$ usually it's bad to have multiple ways to solve the challenge, though here it's pretty easy to tell which method's gonna be the easiest \$\endgroup\$ – dzaima Mar 29 '18 at 21:18
  • \$\begingroup\$ @dzaima exactly, that's why I want to allow it to see if SOGL or some other language with crazy flipping commands can do this the "harder" way. \$\endgroup\$ – Magic Octopus Urn Mar 29 '18 at 21:19
  • \$\begingroup\$ If you're going for Albuquerque spelled backwards, that's not how it's spelled. \$\endgroup\$ – AdmBorkBork Mar 30 '18 at 13:25
  • \$\begingroup\$ Shouldn't the example have a gap of three newlines between the H and the I, not two? \$\endgroup\$ – praosylen Apr 1 '18 at 0:00
  • \$\begingroup\$ @AidanF.Pierce great catch. \$\endgroup\$ – Magic Octopus Urn Apr 2 '18 at 11:50
0
\$\begingroup\$

Radioactive Quine Sums

Related: Radioactive Quines

Challenge

Write a program that takes an integer as input and....

  1. When the program is run it outputs the input.
  2. When you split the program in half, each sub-program should take as input the output of the original program, and output a number. The sum of the two numbers should equal the output of the original program.
  3. Repeat the procedure with each valid sub-program.

Your score is byte count/[valid programs]2 (lowest score wins).

Specs

  1. When you split an odd-length program in half, the program on the left gets the extra character.
  2. For a sub-program to be valid, the sum of its output and its pair's output must be the input, for every possible input n, -100≤n≤100.
  3. A sub-program that doesn't compile/doesn't output a number is invalid (along with its pair).
  4. If a program is invalid, it can't be split further.
  5. A program that outputs "0" for more than one input can't be split further.

Testcases

Pseudo-langauge: A adds a 0 to the stack, Q adds the input to the stack. - negates the element to the right of it.The output is the sum of the stack elements.

  1. Q Score: 1/1 = 1
  2. AQ Score: 2/3² = .222 (AQ -> input, A + Q -> 0 + input)
  3. AAQ Score: 3/3² = .333 (AAQ -> input, AA + Q -> 0 + input) [Since the output of AA is 0, you can't split it any further]
  4. QAA Score: 3/5² = .12 (QAA-> input, QA + A -> input + 0, Q+A -> input +0) [Since QA -> input, Q and A are valid sub-programs, since the sum of their outputs equals the output of QA.]
  5. QAQ Score: Infinity [Since QAQ outputs 2*input, it is invalid and can't be split further.]
  6. QQ-Q Score: 4/5² = .16 (QQ-Q -> input+input-input,QQ+-Q -> (input+input)+(-input), Q+Q->input+input, -+Q->error) [Q and Q are valid subprograms of QQ because the sum of their outputs is 2*input, which is the output of QQ.]

Feedback Appreciated

| |
\$\endgroup\$
  • \$\begingroup\$ 0=0+0=(-1)+1, why can't it be splitted further? \$\endgroup\$ – user202729 Apr 2 '18 at 6:38
  • \$\begingroup\$ @user202729 because someone would just leave it always zero \$\endgroup\$ – l4m2 Apr 2 '18 at 15:30
  • \$\begingroup\$ However I still think score->0 solution exist, so \$\endgroup\$ – l4m2 Apr 2 '18 at 15:31
  • \$\begingroup\$ For 0=(-1)+1: Language W=output the input 0=output zero Q=quit WQ0Q0Q0Q0Q0Q0Q0Q has low score \$\endgroup\$ – l4m2 Apr 2 '18 at 15:33
  • \$\begingroup\$ @l4m2 and user202729 look at rule 5 in Specs. \$\endgroup\$ – geokavel Apr 2 '18 at 17:01
  • \$\begingroup\$ @geokavel we know the rule, just analysing whether they are good here \$\endgroup\$ – l4m2 Apr 2 '18 at 17:03
  • \$\begingroup\$ @l4m2 yeah, i see your point about WQ0Q0.... scaling infinitely. \$\endgroup\$ – geokavel Apr 2 '18 at 17:04
0
\$\begingroup\$

Heroes of Might and Magic 0: A Numerical Boxing Match

It's time to program a game!

Well not a game, precisely. More of a stripped-down version of a game, without graphics or real-time input... or really much of anything. But it'll modify numbers on screen, and isn't that why we play games in the first place?

To elaborate:

If you're unfamiliar with the Heroes of Might and Magic franchise, here's the very most basic workings of the combat system: A stack of creatures of a single type (say, 2 green dragons or 1000 marksmen) will simultaneously attack another stack of creatures of a single type. Each creature does a specific amount of damage, and that's reflected in how many troops in the opposing stack die.

For example, let's have 5 angels vs. 100 skeletons, and let's have the angels go first. If they hit 50 damage each, then 5*50 = 250 damage will be done to the skeletons. If the skeletons each have 10 health, then 250/10 = 25 skeletons will perish, leaving 75.

Next, the skeletons attack. If the skeletons deal 2 damage each and angels have 100 health each, the skeletons will do 2*75 = 150 damage to the angels. But how can we kill 150/100 = 1.5 angels? What happens is that one angel will die, and then the remaining 150-100 = 50 damage is dealt to the top angel in the stack. This angel will be the first to receive damage on the next round and will only require 100-50 = 50 damage to die, but can still deal damage like normal in the meanwhile.

Then angels attack skeletons, skeletons attack angels, angels attack skeletons... repeat until only one stack of creatures remains!

There are loads of other mechanics involved in actual combat, but the fundamental one is attacking, and that's what you'll be programming today.

Technical Specification

Two stacks of monsters will be attacking each other. Each of these stacks has three properties:

  1. Size, positive integer. This is how many total monsters are in the stack.
  2. Health, positive integer. This is how much damage is needed to kill ONE.
  3. Damage, positive integer. This is how much damage EACH monster in the stack will deal.

When a stack of monsters A attacks a stack of monsters B, all of the monsters attack, dealing

A_size * A_damage

total damage. This kills a total of

floor(A_size * A_damage / B_health)

monsters in B. If the damage dealt isn't an even multiple of B_health, then the remaining

(A_size * A_damage) - (B_health * floor(A_size * A_damage / B_health))
= (A_size * A_damage) % B_health

damage is dealt to the top monster in B, which will persist into the next round.

Input

You'll receive two groups of three numbers, each of which contains information about one stack of monsters: The total number, the health of each individual, and the damage dealt by each individual.

[(A_size, A_health, A_damage), (B_size, B_health, B_damage)]

You can receive this as two lists/tuples/arrays of three, six separated values in a single line, or six newline-separated values. The first group of numbers represents the monster that attacks first.

Output

After the fight is finished, you must output the number of remaining troops in the winning stack.

Examples

Input: [(1000, 10, 2), (500, 15, 3)]
Output: 763

Input [(1, 2, 3), (4, 5, 6)]
Output: 4

Input [(100, 100, 1), (100, 100, 1)]
Output: 10

Lowest byte count wins!

Feedback

  • Is the challenge clear? I feel like it's simple and maybe I'm being too verbose in explaining it, but maybe it isn't.
  • Are there any other good ways to accept input?
  • Does it seem like it'd make a fun challenge? If not, are there any changes I could make to make the challenge more interesting?
  • Anything else?

Thanks everyone!!

| |
\$\endgroup\$
0
\$\begingroup\$

See all the blocks

In a 3D coordinates, a block (a,b,c) takes the place of x<a<x+1, b<y<b+1, c<z<c+1.

  1. Is there a point that can see every block? (Exist point P, For each block K exist point Q, segment PQ don't go across any block but K)
  2. Is there a way that can see every block? (Exist non-zero vector w, For each block K exist point Q, for each positive number t, Q+wt is not in other blocks than K)

Output four values to represent the four possibles.

Shortest code in bytes win.

| |
\$\endgroup\$
  • 2
    \$\begingroup\$ Although the challenge idea is good, we generally expect people to make the challenge reasonably-complete in the sandbox ("write your challenge just as you would when actually posting it"), and not just the ideas. (for example: what is the winning criteria?) \$\endgroup\$ – user202729 Apr 4 '18 at 6:55
  • 2
    \$\begingroup\$ Also, it appears that there are 2 different challenges here that needs to be solved in very different ways. Consider having 2 different posts. \$\endgroup\$ – user202729 Apr 4 '18 at 6:56
0
\$\begingroup\$

Write a program that, in different languages, output a different permutation(the exact source is counted as one permutation) of the code.

Proper quine rule apply. Largest (Language count)^6/(Code length) win.

Sample: If your code is AAB and running in several languages return ABA, AAB, AAB, then its score is 2^6/3.

| |
\$\endgroup\$
  • 2
    \$\begingroup\$ "Shuffle" implies randomness. I'm assuming that this isn't what you want: "Ordering" is a better term: You want a set of programs that output the same bytes, but in different orders. \$\endgroup\$ – Nathan Merrill Apr 7 '18 at 5:31
  • \$\begingroup\$ Or "permutation". \$\endgroup\$ – user202729 Apr 7 '18 at 6:08
  • \$\begingroup\$ Do the output need to be valid (executable) source code or it may be mess of reordered characters? \$\endgroup\$ – tsh Apr 8 '18 at 6:46
0
\$\begingroup\$

The 3n+1 problem

The legendary problem in UVa Online Judge, with over 775k submissions and over 85k people who solved it. I, personally, have solved it in many ways, even reaching the best time below 0.01 sec.

Even though the problem is interesting from the algorithmic point of view, insofar as reasonable time constraints would be easily able to force people to think about some sane approach to caching and use data structures like the segment tree, it is actually not the case here: the time constraints, on UVa, are so lax that even a purely naive algorithm is accepted by the judge. Since we are on CodeGolf and not on a programming contest, we aim here to write shortest code, and not necessarily fastest one, so for most part you don't need to care about performance - that is, as long as it is not horrible even beyond the lax allowances of the online judge; more on that below.

The input

The input will consist of several lines, each containing a pair of integers i and j, such that 0<i,j<1,000,000.

The output

For each line of input, you are to print one line of output that will consist of integers i and j, in that order, followed by one number that will denote the maximum length of the Collatz sequence (also known as the 3n+1 sequence), over all numbers between and including i and j. Note that while in mathematics the terminal number 1 usually doesn't count to the length of the sequence, in this problem it does.

The Collatz sequence is defined as follows: If an is odd, then an+1:=3*an+1; or, if an is even, then an+1:=an/2. The sequence ends when it reaches number 1.

Sample input (taken from UVa):

1 10
100 200
201 210
900 1000

Sample output (taken from UVa):

1 10 20
100 200 125
201 210 89
900 1000 174

Additional notes:

  • There is no guarantee that i<=j. The input may contain lines with i>j. However, even in these cases, you are supposed to print out i and j in the output in the correct order (that is, i comes before j, not min(i, j) before max(i, j).
  • There is a guarantee that, while computing the Collatz sequence terms, no term will overflow a 32bit integer.
  • As of now, the problem specification gives incorrect input boundaries, claiming that all numbers will be less than 10,000. The correct bound seems to be 1,000,000 instead, which is present in the archived version of the problem specification. Since last time I checked the judge required accepted programs to be able to process numbers up to 1,000,000, we retain that requirement in our problem.
  • Your program must perform actual computations. Hardcoding all sequence lengths for numbers between 1 and 1,000,000 is unacceptable. So is fetching them from external sources.
  • Your program must read from standard input and write to standard output. Your program must format its output as required by UVa Online Judge for this program.
  • Of course, we do not retain the original harsh requirements on acceptable programming languages. Any programming language is OK as long as it doesn't violate the standard loopholes.
  • Your program must correctly process all lines until EOF and then exit gracefully. Your program must not wait endlessly on EOF, enter an infinite loop on EOF, crash on EOF, exit with an error, etc.
  • Performance restrictions:
    • Basically, the intention is to allow everything but most horribly underperforming programs.
    • To be more specific, the naive algorithm that, for each line of input, computes once the whole sequence for each number in the required range is allowed (example of an allowed program). It is also allowed to keep an array caching lengths of all sequences starting with numbers from 1 to 1,000,000 (example of an allowed program), or to keep a dictionary caching lengths of all sequences starting with any encoutered numbers so far (example of an allowed program); however, it is not allowed to keep an array caching all encountered lengths, since that array would be unreasonably sparce and thus unreasonably large (example of a disallowed program); it is also not allowed to precompute a 1,000,000x1,000,000 array that would keep all maximums of lengths in all valid ranges (example of a disallowed program). Your program may precompute lengths even for numbers that would otherwise be disallowed by the guarantee of not overflowing a 32bit integer (example of an allowed program), if you wish.

Shortest code wins.

| |
\$\endgroup\$
  • 4
    \$\begingroup\$ From a golfing perspective, this looks like basically the usual Collatz challenge, taking the max over an interval but with Cumbersome I/O and non-observable performance requirements. \$\endgroup\$ – xnor Apr 8 '18 at 7:03
  • \$\begingroup\$ @xnor , I don't think these requirements are non-observable, my intention was to disallow everything the judge disallows without imposing the programming language restrictions; anyway; a 1,000,000x1,000,000 array of integers is around 3.5TB!! - I think disallowing this makes sense? Basically my intention was to prevent saying that "In a computer with unlimited resources this program would complete and is therefore valid". If I want to disallow this, am I supposed to rather prepare my own test case and run the program on my computer to see if it fits in reasonable time/space requirements? \$\endgroup\$ – gaazkam Apr 8 '18 at 12:56
  • 2
    \$\begingroup\$ I think I'm not understanding the restrictions then -- is what you intend is just a hard bound on run-time and memory, and the types of programs that work are just examples? Regardless though, I expect it not to matter as golfed programs will just compute the whole sequence for each number in the range, which you allow. All the optimizations seem like they'd take more characters. \$\endgroup\$ – xnor Apr 8 '18 at 23:45
  • 1
    \$\begingroup\$ ... yes, to have such requirements you have to run it yourself (or ask someone to do this for you) Although, if as you said (almost every algorithm) are allowed, what's the point in having another challenge? I would call this a dupe. \$\endgroup\$ – user202729 Apr 9 '18 at 15:13
  • \$\begingroup\$ One more point: If there exists a programming language where hardcoding 10⁶ terms is shorter than computing them, you should reconsider the challenge. \$\endgroup\$ – user202729 Apr 9 '18 at 15:14
0
\$\begingroup\$

___ encrypting

Given two text a and b, both contain only lowercase letters

  1. Write each charactor in a into 5 digits of binary (a => 00001, z => 11010)
  2. Write each charactor in b where such place of the binary list is 1 is written into a different style (uppercase, bold, etc., but should be consistant)
  3. If some char remain in b, either keep them all in the 0 style or remove them. You can assume b has enough chars.

Sample:

a = cat, b = programmingpuzzlescodegolf

  1. Write a into binary 000110000110100
  2. So the output can be proGRammiNGpUzz, proGRammiNGpUzzlescodegolf, programmingpuzzlescodegolf, etc.
| |
\$\endgroup\$
  • \$\begingroup\$ You should probably mention a specific win condition. \$\endgroup\$ – Nissa Apr 10 '18 at 13:07
0
\$\begingroup\$

A Magic Ritual

Given an input string N perform a sequence of steps.

  1. Delete all spaces from the string.
  2. Delete all other occurrences that come after the first one of the same letter from the string.
  3. If the string contains the letters needed for zero, delete these letters and add the corresponding digit 0 to the end of the string. Repeat this for 0 to 9.
  4. Order the characters left in the string by the alphabet, then by their numeric values.

Input

May be received as a string, an array of characters or any other reasonable input for text.

You may assume that the input will only consist of characters including a-z (lowercase) and spaces.

Output

Same as input, or may be directly written to stdout.

Rules

  • This is , the shortest code in terms of bytecount wins.
  • Standard loopholes are forbidden.

Test Cases

a magic ritual -> acgilmrtu
sixone -> 16
codegolf -> cdefglo
the quick brown fox jumps over the lazy dog -> abcdfghjklmnpqtuvwy06
qwertyuiopasdfghjklzxcvbnm -> abcdfghjklmnpqtuvwy06
| |
\$\endgroup\$
  • \$\begingroup\$ Do second occurrences include 3rd 4th etc? \$\endgroup\$ – l4m2 Apr 10 '18 at 8:14
  • \$\begingroup\$ @l4m2 Yes, I'll clarify. \$\endgroup\$ – Ian H. Apr 10 '18 at 8:15
0
\$\begingroup\$

Count the Matches


Given a stripped-down regular expression, estimate (rules below) the number of lower-ASCII-only strings that it matches fully (meaning it matches the whole string).

You should handle the following:

  • Literals/sequencing
  • Vertical bars ...|...
  • Groups (...) or (?:...)
  • Special characters escaped with a preceding \
  • Character classes [...]
  • Complemented classes [^...]
  • The standard classes ., \d, \w, \s, \D, \W, and \S
  • The escape sequences \f, \n, \r, \t, and \xhh
  • The quantifiers ?, {x}, and {a,b}

Estimation Rules

Literals

Literals, obviously, match only one string.

aaaaa --> 1

Classes

The estimate for a class is the number of characters that it can match. If multiple are seen, then their individual counts can be multiplied. There are also the standard classes: \d is [0-9], \w is [_A-Za-z\d], and \s is [ \n\t\r]. \D, \W, and \S are the complements of their lowercase versions.

a.b --> 127
\D --> 118
[a-gd-k] --> 11
[^\w$A] --> 64
[abc][xyz] --> 9
\d\d\d --> 1000

Switches

Switches (vertical bars) should be estimated as the sum of the component expressions.

a|a --> 2
a|b --> 2
(0|1)[01] --> 4
0|1[01] --> 3
optional| --> 2

Quantifiers

With a static quantifier, you can treat it as a power function. With a variable quantifier, you can use the geometric sequence formula to get the estimate:

a1 is the first term, in this case the estimate at the lower bound. r is the common ratio, for which you should use the estimate for the group quantified. n is the number of terms, which is the upper bound minus lower bound plus one for the quantifier.

[01]{10} --> 1024
.? --> 128
[01]{3,10} --> 2040
0|[12]{3} --> 9
(0|[12]){3} --> 27
\d{30,40} --> 99999999999000000000000000000000000000000
(?:a{2,3}){2,3} --> 12

Shortest code in bytes wins.

| |
\$\endgroup\$
  • \$\begingroup\$ The examples require support for sequencing, which is not listed as something which must be supported. The standard classes with upper case are not explained. (?:...) is mis-labelled: it's a non-capturing group. \$\endgroup\$ – Peter Taylor Apr 12 '18 at 10:49
  • \$\begingroup\$ Also what's the charset? 0-127? \$\endgroup\$ – l4m2 Apr 12 '18 at 14:49
  • \$\begingroup\$ @l4m2 it's lower ASCII, so yes. \$\endgroup\$ – Nissa Apr 12 '18 at 15:54
  • \$\begingroup\$ ASCII sometimes onlt mean 32-126 though \$\endgroup\$ – l4m2 Apr 12 '18 at 17:19
  • \$\begingroup\$ @l4m2 that's printable ascii. \$\endgroup\$ – Nissa Apr 12 '18 at 17:27
0
\$\begingroup\$

Tell SMILES from FROWNS


The Simplified Molecular-Input Line-Entry System file format is used to store structures of organic molecules. For information on why there is an actual file format called "smiles", consult this comic from PhD Comics. As a summary of the format:

  • Start the file with a root chain of atoms.
  • Put each branch group in parentheses after the atom it connects to.
  • Use = for a double bond and # for a triple bond.
  • Break aromatic rings and number the bonds broken; add those numbers after the atoms bordering them.
  • Put metal atoms and any ions in square brackets.
  • Omit hydrogens attached to carbons. Their presence is assumed.

For example, 1-chloro-3-ethylbenzene could be C=1(CC)C=CC(Cl)=CC=1.

Challenge

Let's make a new acronym, FROWNS: Fraudulent, Ridiculous, Overbonded, Wacked, or Nonexistent SMILES. Basically, a SMILES string is a FROWNS string if any of the following apply:

  • A loop is unclosed or closed twice.
  • An atom from period 2 (Li, Be, B, C, N, O, F, Ne) has more than 4 total bonds.
  • A neutral nitrogen atom has 4 total bonds.
  • An oxygen atom has more than 2 difference of bonds - charge.
  • A fluorine atom has anything other than exactly 1 bond.
  • Noble gasses other than xenon are bonded.

Your program should determine whether a given SMILES string is a FROWNS string.

Here are some examples of FROWNS:

C1=CC=CC=C
CC(C)(C)(C)C
C1=CC=CC=C1C=CN1
C#C#C
C=N=C
CC#O
OFO
FKr(F)(F)(F)(F)F
FXeF(F)(F)

These, however, are not FROWNS:

C1=CC=CC=C1
CC(C)(C)C
C12=CC=CC=C1C=CN2
C#C
C[N-]C
CC=O
OClO
FXe(F)(F)(F)(F)F
Xe(F)(F)(F)(F)

May the shortest code win.

| |
\$\endgroup\$
  • 1
    \$\begingroup\$ SMILES is a relatively complicated format, so it might be a good idea to define your own subset of it and set it out in the question, so that people don't have to worry about whether they have to implement aromatic bonds or stereochemistry or what have you \$\endgroup\$ – Nathaniel Apr 13 '18 at 15:53
  • \$\begingroup\$ @Nathaniel my subset called FROWNS is somewhat strictly defined, so that shouldn't be a problem. \$\endgroup\$ – Nissa Apr 13 '18 at 17:50
  • 1
    \$\begingroup\$ I don't think it's well defined enough. Is F/N=N/F a FROWNS string, for example? Technically yes, because it is a SMILES string containing an N with 4 bonds. But do you really need people to support stereochemistry for this challenge? I don't think you do, which is why I suggest you define your own subset of SMILES instead of relying on the relatively complex standard. This will also have the advantage that people won't need to understand organic chemistry to compete in the challenge. \$\endgroup\$ – Nathaniel Apr 15 '18 at 4:29
1
73 74
75
76 77
98

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .