The problem is that the algorithm for encoding into base32/base64/ascii85/base91 are all very similar, and the same goes for decoding, so they are not very interesting (and you'll get a bunch of built-in or library function answers)
When one of my questions got closed as a duplicate (correctly), I got this screen.
Then, when I clicked the delete button, this showed up:
Then when I confirmed, I got this:
What's the point of showing the delete button if I'm not allowed to use it? It's redundant and annoying - is this intent...
When I was in grade 3, we were taught how to solve a very simple math problem. It was equaling the denominators of two or more fractions.
Let's take two proper fractions:-
$$
\frac{1}{2},\frac{2}{3}
$$
First we will take the Least Common Multiple of the denominators of the two fractions, the LCM ...
Tbh I have never copy pasted from SO, for the few years where I needed it I'd rewrite it myself so I could understand what was going on and make it follow my formatting (i.e. none)
Newcomers to codegolf.SE are often compelled to ask what many of our abbreviations and terms mean. Let us list them here so this information always will be easily available.
Return to FAQ index
> Built-in functions and libraries are allowed, as long as they do not perform big portions of the procedure in one call, i.e., extracting all blocks of size m from A [or] counting the number of occurrences of a given block x
I think that's the worst builtin ban I've ever seen
From this challenge, where the task is basically "extract blocks of size m from A, count the number of times each block appears, then do some math with those numbers"
I mean if you have a one byte builtin for doing the challenge and add two no-ops to the end, I'd say that's allowed since obviously that builtin is only doing a third of the procedure and that's not a big portion :p
> The pen-and-paper game Telephone Pictionary (also known as Eat Poop You Cat) is played by alternately writing and illustrating captions, the paper being folded so that each player can only see the previous participant's contribution.
Okay so it turns out that when I was talking about that compression algorithm I came up with a few months ago I had basically just reinvented Huffman coding and DEFLATE :/
(The format was obviouly way different, but the logic itself was very similar)
Well, y'know what they say, "the best way to learn is to spend two weeks thinking about a really cool idea you had then realize it's existed for half a century"
One interesting difference between my algo and existing things like DEFLATE and LWSS is that it didn't differentiate between raw data and pointers; every character in the raw data was just given a pointer
It also only grouped things into pointers in pairs, which was more of me being lazy than innovative
Irreducible Rube Goldberg Sort (WIP)
sorting code-challenge
You are given a list containing at least 10 integers. You must sort them in the most complicated and roundabout way possible.
Your task is to write \$n\$ programs (or functions) which, when combined in a specific constant sequence (spec...
If no new nominations get added, plumber would become LotM in half a year or so. Considering deleting my nomination for it, since I've got much more interesting languages to nominate now and I don't want to nominate two of mine (unless y'all are fine with it)
In accordance with our meta agreement, since one candidate received more votes than the others, we have a new featured language! Throughout April 2021, our Language of the Month will be:
Vim
What's a Language of the Month?
See the meta post for nominations. In short, during April, those who wis...
TIL that the Sandbox used to have a submission dictionary of sandboxed challenges in the question itself, which explains the 285 revisions to the question :P
I want to make a programming language someday where random mutations make the program still work, just slightly differently. That way you can have mutating, evolving programs.
A Graceful Graph is a type of Simple Graph. Graceful graphs are special because there is a way to label all their nodes with positive integers so that when the edges are also labeled with the differences of the nodes they connect, no two edges have the same label and every label up to the number...
To raise \$ e \$ to the power of a matrix code-golf math matrix
Inspired by this 3Blue1Brown video
Given a square matrix \$ M \$, compute \$ \exp(M) \$, which is defined as
$$ \exp(M) = \sum_{r=0}^\infty \frac {M^r} {r!} = M^0 + M^1 + \frac 1 2 M^2 + \frac 1 6 M^3 + \cdots + \frac 1 {n!} M^n + \c...
@OriginalOriginalOriginalVI nope, you broke the few rules I did specify: 0: having types that aren't monads or functions, 1: not designing a new language, using an existing one instead
@OriginalOriginalOriginalVI Personally, I prefer pegasi. They're far more useful than unicorns, whose only redeeming feature is that they can impale people. Research done on flying horses could be used to improve our own technology and potentially put Red Bull out of business.
I read this in a product review, and it has been bugging me all day.
Three words: it's really cheap.
"It's" is obviously a contraction of two words, but does it count as one or two words?
@Wezl I don't know why, but it way too long to figure out that that was a 3. First I thought it was a J, then I thought it was some weird Unicode character from Jelly or something.