Today, I learned that TIO cannot simulate thread waits.
I was going to ask a code golf that simulates Poisson point process, and wrote the following C++ code snippet:
#include <thread>
#include <iostream>
#include <random>
#include <chrono>
int main()
{
std::random_device rd;
std::mt199...
Inspired by this lumosity mini game, Pinball Recall
We start with a rectangular grid (viewed from above) with several bumpers as follows. Entrances/exits are numbered counter-clockwise starting from the leftmost of the bottom of the grid, as number 0.
24 23 22 21 20 19 18 17 16 15
25 . . ...
@JoKing Well, it's not. What Monica was fired for is complex and poorly understood by those outside the company, but I do know it wasn't that. (Though I agree with the edit; she doesn't like being called "they", and we should respect that.)
@primo I mostly agree with that, except perhaps with ordering by time inserted between the two, so the top doesn't get clogged with the same language... Though that may be a problem in languages with few submissions e.g. brainfuck?
it does end up FGITW if that happens, though as solutions get shorter, people will get bumped from the top
@wizzwizz4 Well I know it wasn't exactly that, rather for questioning whether she could keep her writing gender neutral regardless of what pronoun the subject prefers, but since Sara was pretty much doing the same thing by anonymising Monica as "a moderator", I was generalising it as close enough
I do wish SE could be a little more transparent (or even just not straight up opaque) with the reasons/CoC violations behind it, rather than saying "We're sorry you were hurt by this, but we'd totally do it again if we had to"
@primo how in the world have you solved this in 213 characters? code-golf.io/scores/12-days-of-christmas/php I know you are a master golfer, but even the unique words in that challenge are longer than 213 chars, my tiny brain cannot understand :(
For those who don't know, it's a pass / fail programming challenge system where the winning criteria are defined in code, sometimes in the language's usual testing API (but often not).
Plain Hunt
code-golf
Your task is to create a plain hunt (a bell ringing pattern) with n bells. An example with 6 bells:
123456
214365
241635
426153
462513
645231
654321
563412
536142
351624
315264
132546
123456
Each number "bounces" off the side of the grid. From Wikipedia:
Each bell ...
Yeah; it reminds me a bit of the Reddit source code.
It'd be great if it was federated, over ActivityPub or something, so you could have challenges across multiple different sites when they shared scopes.
@DJMcMayhem bonus: When you program in an Esolang, you don't have to worry about good design patterns, as you end up worrying about making it work in the first place
Today, I learned that TIO cannot simulate thread waits.
I was going to ask a code golf that simulates Poisson point process, and wrote the following C++ code snippet:
#include <thread>
#include <iostream>
#include <random>
#include <chrono>
int main()
{
std::random_device rd;
std::mt199...
Inspired by this lumosity mini game, Pinball Recall
We start with a rectangular grid (viewed from above) with several bumpers as follows. Entrances/exits are numbered counter-clockwise starting from the leftmost of the bottom of the grid, as number 0.
24 23 22 21 20 19 18 17 16 15
25 . . ...
Plain Hunt
code-golf
Your task is to create a plain hunt (a bell ringing pattern) with n bells. An example with 6 bells:
123456
214365
241635
426153
462513
645231
654321
563412
536142
351624
315264
132546
123456
Each number "bounces" off the side of the grid. From Wikipedia:
Each bell ...
