- The structure of the program as a binary tree - A list of operators
The binary tree represents dyads, monads, and nilads. There's two types of leaf nodes, one for nilads and one for inputs, which don't have an associated entry in the list of operators. This allows more complex implicit input and reduces overhead for functions.
challenge idea; for a list of positive integers X, a "complement" of X is any list of positive integers Y such that X union Y is a list of consecutive integers with no repeats e.g. [2,4,6,7,8] is a complement to [1,3,5] any given posint list X has a smallest complement Y, which has a smallest complement Z... etc until you have the empty list
Enumerate the Microwave Timer
code-golf
Related
Sometimes when I use my microwave, I do a little trolling and enter times such as 2:90 instead of 3:30 because they end up being the same time anyway. The microwave happily accepts this and starts counting down from 2:90, displaying times like 2:86...
The phrase man bites dog is a shortened version of an aphorism in journalism that describes how an unusual, infrequent event (such as a man biting a dog) is more likely to be reported as news than an ordinary, everyday occurrence with similar consequences, such as a dog biting a man. An event is usually considered more newsworthy if there is something unusual about it; a commonplace event is less likely to be seen as newsworthy, even if the consequences of both events have objectively similar outcomes. The result is that rarer events more often appear as news stories, while more common events appear...
The "Examples of literal use in journalism" heading has a concerning amount of entries
Iterative Smallest Complement
For this challenge, we will define the "complement" of a list of positive integers A as being any list B such that the union of A and B is a list of consecutive positive integers with no repeats.
In other words, B is the complement of A if
B has all of the integer m...
I do think I have a good solution to that written in haskell now though
also on the subject of that post, I do think requiring the outputted times to be in order is sensible, partly as I have no idea how a solution that outputs them out of order would even work
another small question that pertains specifically to my solution is if a flat list (like [minute,second,minute,second,minute,second,minute,second....] is an acceptable output format
that's something I was considering, and I don't know how I feel about it. On one hand, I'm totally fine with people coming up with creative ways to solve the challenge but on the other hand, it makes reading the output a little harder and doesn't exactly resemble the display of a microwave
A disproportionate number were in reply to comments by @ceilingcat, who apparently deletes their comments a lot, and doesn't then flag replies to them. So a lot of them were on answers in C
@emanresuA seems interesting, I think it could be a little more clear that youre expanding it by "tiling" it out as opposed to, say, repeating the edges outwards
@pxeger Today's data: comment flag limit 60, raised 66 comment flags; 60 automatically marked helpful; 6 needed manual review, of which 4 have so far been approved. (+1 post flag)
So, maybe, flags that require manual review don't count to your daily limit? Or only sometimes do?
@emanresuA also currently trying to come up with a haskell solution to this (can you tell im trying to learn haskell?), and it is giving me some yelling-about-types that I think is an actual problem with what I'm trying to do, and not just me writing it wrong
the weakness of haskell having such a strong type system is that all coding mistakes producing 15+ lines of errors complaining about type mis-matches
Given a multidimensional, rectangular array and a list of dimensions, such as:
[ [1, 2],
[3, 4] ]
[3, 4]
Your challenge is to extend the matrix to the dimensions given in the list.
To extend an array to a length in a single direction, simply repeat its elements; for example, if we want to ext...
Also flax v0.x.x are all beta versions. I might push breaking changes a lot but once I feel that I will not make any major breaking changes then I will release v1.0.0
In this challenge, users will take turns completeing three fairly simple coding tasks in programming languages that are allowed to be progressively older.
The first answer must use a programming language that was made in the year 2015. Once there is at least one answer from a 2015 language, answ...
Challenge
Create the image of a progress pride flag.
Output
Dimensions
Rules
Your program must (obviously) create the image and not just load it from a website
The colours can be just your language's default if it is very difficult / impossible to load RGB values, else they should be: red: (25...
To increase data safety at our company, we are planning to start using gray code numbers (where successive values differ by only one bit) instead of classical binary ones.
Please help us to make a program that converts numbers to gray code (single number to single number), but the program needs t...
Is it basically a generator attached to a path finder (where the path finder is basically an answer to your original question)? Or are they combined or something?
CMC: given a positive odd integer N, return a sorted, length-N list of consecutive integers with 0 as the center element. Example: 5 => [-2, -1, 0, 1, 2]
Strange ponds (WIP)
A few things need to be ironed out, but hopefully you can get the intention of this challenge.
In this challenge we considered a frog hopping around a lily pond. To recap the lily pond was represented as a finite list of positive integers. The frog can only jump forward or b...