What the heck, I just dreamed my alarm clock was broken, woke up at 2:30 AM, got dressed in a panic, went downstairs and realized my alarm clock was correct.
Elo ratings, treating pairs of submissions as games.
I'm using the Elo system here.
Essentially, the solution is find the best solutions in each language to each challenge, and then treat each pair of such solutions as a match between those two languages, with the winner being the shorter submiss...
This is a relatively simple question. I'm trying to golf a Snake game I've written, and I'm trying to work out if there's a way to golf the following conditional assignments which control x and y coordinates of the snake ensuring a wrap around of the play area:
if (P<0) {
P = T-1;
}
if (P>T-1) ...
@Razetime TBF a lot of the language’s user bases have left. Me and Jonathan Allan are pretty much the only 2 Jelly posters who still regularly post (Lynn does on occasion and xigoi’s getting going, but Dennis, Xcoder, miles, fireflame, Leaky and Erik have all left)
Until the LotM, Husk was close to dead. Really 05AB1E and Japt are the only two golfing languages that have kept dedicated posters over the past 2/3 years
Ohm v2 was the same, the reason you barely see it now is because Xcoder and totallyhuman were the main posters (along with the creator, I forget their name) and they’ve both gone inactive
@Razetime Quite possibly. TBH Arn and Stax have never been my favourite languages. They seem to be more “how good is the language’s compression?” rather than “how inherently golfy is the language?”
The language I've written that gets the most use by those other than me is RProgN2 entirely because it has a funny stack behavior that makes one type of quine really easy.
There’s a SEDE script somewhere in the transcript which counts how many answers each user has posted in a specific answer, and like 8/10 of the top Jelly posters are inactive
@ATaco Same. It’s such a shame there’s nothing we can do to help, makes it even worse :(
I have a problem, which I haven't found a solution for. Solutions to the first part are well documented, but I have yet to find anyone who has solved the second part. I call this the "Dobble" challenge...
Challenge 1
Using the numbers 1 - 57, populate 57 arrays. Each array must have 8 numbers in ...
Golf me a polygonal loader ascii-art code-golf animation
Given three positive integers as input, animate an ascii-art polygonal loading symbol on the screen.
Intro
Using the first input \$n\$,
Take one the following regular polygons:
* * *
* ...
Sociable numbers
Sociable numbers are a generalisation of both perfect and amicable numbers. They are numbers whose proper divisor sums form cycles beginning and ending at the same number. A number is \$n\$-sociable if the cycle it forms has \$n\$ unique elements. For example, perfect numbers are...
\$723 = 3 \times 241\$ is a semi-prime (the product of two primes) whose prime factors include all digits from \$1\$ to \$n\$, where \$n\$ is the total number of digits between them. Another way to look at this is that the (sorted) digits in the factorisation of \$723\$ are all consecutive. The f...
History
I hope every one remembers Monica Cellio so...
Task
You need to write a program/funtion that prints/returns all names of all users that have Reinstate Monica in their name on Code-golf SE (this site).
More detailed:
It shouldn't find any other "supporting Monica" things like avatars etc....
I was going to joke about how this is the most useless Google Trends map, except that it turns out it's really accurate at determining the increase in access to the internet over time in developing countries
This challenge is about the following version of edit distance. Say we have a cost of 1 for inserts, deletes and substitutions as usual with one exception. A substitution for a given letter x for a letter y only costs 1 the first time. Any further substitutions of x for y cost 0.
As simple exam...
Makes sense, you might want to clarify the step by step breakdown with that as it makes it seem at first like you have to follow all of them (maybe "while also following one or more of the restrictions" instead of "while also following the restrictions")
The only issue I can think of with the actual challenge is that it seems like it would stay easy if the current restrictions are easy (because there'd be many to pick from), and stay hard if the current restrictions are hard (because there'd be few to pick from).