For anyone interested, Cardano, Vi and Vim, Science Fiction & Fantasy, Ethereum, Iota, Ebooks, Quantum Computing, Islam, Arduino, and ExpressionEngine® Answers have upcoming elections.
Just in case power doesn't come back on in the next 40m, does anyone here have access to a server with node installed? If it's still out in about a half hour it'd be nice to be able to move the bots over rather than restart the feeds.
Program the sequence \$R_k\$: all numbers that are sum of square roots of some(maybe one) natural numbers \$\left\{\sum_{i\in A}\sqrt i\middle|A\subset \mathbb{N}\right\}\$, in ascending order without duplication. Outputting zero is optional.
You should do one of:
Take an index k and output \$R_...
But if there's under 5m of power left on my UPS or I go offline, all you should need to do is put that in a folder somewhere, run chmod +x install, ./install, and run the startup command it'll print
How is this not a duplicate? I'm certain I've seen that exact challenge before--in fact, I was searching for it a couple weeks ago (but admittedly couldn't find it).
Vyxal `\`, 0 bytes
```
```
[Try it online!](tio.run/#safdfasdfasdfjiuhygtfgvhbnjkoi98u765432qwsedcfvgbhnjkoi98u)
The empty program just happens to do exactly what this challenge asks for.
@cairdcoinheringaahing I'd disallow floating error issue on such small cases, some solutions taking forever isn't a reason as expection — l4m23 mins ago
@hyper-neutrino "It must often be so, Sam, when things are in danger: some one has to give them up, lose them, so that others may keep them." - Frodo Baggins
there are apparently words that when used in comments allow "unfriendly/unkind" flags to immediately delete them, but idk what the conditions exactly are
and i doubt i can share the list of conditions even if i knew :P
Caution: R-rated language
Some words, when present in a comment, make it eligible for instant, automatic one-flag deletion. Out of the seven words you can never say on television, only
appear to work this way. But then there are other, Stack Exchange-specific dirty phrases:
accept rate or ...
imo the only time you should link to lmgtfy is if you are being passive aggressive about "look it up yourself", which is only acceptable if intended as and taken by the receiving party as a joke
I think for the input that would be a fine way of doing it, but should have to be included not in the source code, but in the answer so as to make sure it doesn't have anything that would help the challenge
I think it's sort of like having print(f(/* input */)) in a TIO footer; you couldn't do anything that actually does part of the challenge, but you don't count it as part of your answer
These I/O methods would be more like "protocols" for implementing other I/O methods, like a number or string of bytes.
Breaking BogoBogoSort (In Badness) code-golfmatharray-manipulationcombinatoricsrandom
The title says it all - make a sorting algorithm with a time complexity of \$O(n!^{n!})\$ or higher in the fewest bytes possible - as far as I can tell, that will require you to make a double exponentiatial form...
with 3, it's 3.8; with 4, it's 16.3; with 5, it's 82.8; with 10, it's already 2.5 million; with 15 values in your list you have an average of almost 1 trillion
@flawr The code generates all such numbers between 0 and \$n\sqrt n\$, and there should, I believe, always be at least \$n\$ of these numbers in that bound, as \$n < n\sqrt n\$
@flawr I'm not sure how yours works, but mine only generates up to \$n\sqrt n\$ because I take the \$n\$th Cartesian power of the first \$n\$ square roots (starting from 0). Just in case that impacts anything :)
Should be. Powerset of range(n), then sums goes up to \$\frac {n(n+1)} 2\$, so the max square root it goes to is \$\sqrt \frac {n(n+1)} 2 \ge n, n \ge 1\$
idk why this just occurred to me, but pressing the thumb mouse buttons (the navigate forward/backward buttons) over top of a window i don't currently have focused will focus it and click on that window
it's a mouse click event so this is exactly what should happen but... intuitively it felt like it should nav forward/backward on the window i'm currently focusing
@cairdcoinheringaahing did you just rotate your three messages in-place xD
our flag queue is actually closer to a queue than a stack though, lol. some things get prioritized but outside of that older flags will show up first (as they should)