Hexagony, 28 bytes
This beats Etoplay's solution
?\.">"!*+{&'=<\%(><.*.'(@>'/
Try it online!
Here it is unfolded:
? \ . "
> " ! * +
{ & ' = < \
% ( > < . * .
' ( @ > ' /
An explanation will come. I just need some help getting the images for it.
I've just written a really simple sorting algorithm but it feels too simple, does anyone want to take a look, see if there are any obvious flaws I've missed?
@WheatWizard HA... Oh lordy, didn't think of that one, it'll be an Enigma if you pick a good enough algorithm. Imagine picking "isPrime" and beating the current record for your entry lmao.
@WheatWizard Should I limit submissions to OEIS sequences only?
Hmmm... valid arguments on both sides... 44 byte program that outputs A, easy to crack... Wont make it to the end. 44 byte program that outputs a 4043923049 char string due to 20 nested loops? Well... Annoying.
Math / numerical analysis question. Consider a number x very close to 1, but not 1, such as 56800235583 / 56800235584. I wish to approximate, to a few decimals of accuracy, say x^1e5. Doing the exact calculation with extended precision numbers isn't feasible. What kind of shortcut could I use to tackle this?
@WheatWizard Wait a minute, what's the maximum number of unique bytes I should allow? Machine language may not follow byte "code page logic". Same with bubble gum.
Given the output of the cop's program (o), the byte-count (n) and the number of unique bytes (c) used, come up with a corresponding piece of code that is n bytes long with c unique bytes which matches the cop's output o.
This is the cops thread post solutions that are to-be-cracked here.
The ...
Given the output of the cop's program (o), the byte-count (n) and the number of unique bytes (c) used, come up with a corresponding piece of code that is n bytes long with c unique bytes which matches the cop's output o.
This is the cops thread post solutions that are to-be-cracked here.
The ...
Given the output of the cop's program (o), the byte-count (n) and the number of unique bytes (c) used, come up with a corresponding piece of code that is n bytes long with c unique bytes which matches the cop's output o.
This is the robbers thread post solutions that you cracked here.
The COP...
Integers are tedious to represent in Brain-Flak. There are 8 operators:
() Evaluates to 1, but does not push anything on any stack
[] Evaluates to an indeterminate value for the purposes of this question
{} Removes the top of the stack and evaluates to it
<> Switches to or ba...
@WheatWizard My point was that for like ~4 minutes () was outputting nothing haha. Then magically POOF 2. think it was my internet connection, at a hotel.
Oof, this is painfully different. I'd almost prefer SPARK assembly >_>.
@WheatWizard There's no way I'm getting your cops thread, I think I'll commit to learning why ({}(<>))<>{(({})){({}[()])<>}{}}{}<>([{}()]{}) works though.
@WheatWizard Yeah, but when I designed it it had more features, they just never got implemented because they weren't really practical, and I haven't touched it since that afternoon when my brain went haywire
Well, since I have integer 8 (used to loop while the cube is not solved), we can do ( ... )8 with an algo that will make it loop 25 times, eliminating the need for one of the variables (kind of)
But what you have to do inside that is not constant. And you cannot "copy" the cube content to the notepad without destroying the cube. (you may, with some special formula over face values, but I don't know)
Seems that 25 is not possible too.
Yes, 25 is impossible. So assume you have 24, what can you do next?
It is even impossible to print any letter unless the notepad has exactly that value, so the cube is the only variable.
While idly twisting my Rubik's cube around, my son noticed that it kept going back to the solved state. I'm pretty sure he thought this was some sort of voodoo magic at first, but I explained that if you keep repeating the same sequence of moves, it will always return to its original state. Event...
I have an executable foo, and a folder dylib which contains all the .dylib files required for foo to run properly. How do I make it so that foo is stand-alone for Mac OS X?
Note - this is completely different to "There are no review queues available to you" - Hey?
I accessed Programming Puzzles & Code Golf Meta today while browsing the main site and clicking on one of the Hot Meta Posts.
My attention started to drift, and wandered over to the top-bar, and on to...
@LuisMendo I actually expected this to be the challenge at first, but then I noticed that there are some cases where you can tile the infinite line, but can't form any contiguous finite blocks.
Public service announcement: I'm opening a Discord server dedicated to explaining ordinals and the fast growing hierarchy. The end goal will be to reach an understanding of the magnitude of TREE(3) and larger things using only recursion, and lots of it. — Simply Beautiful Art16 secs ago
In case anyone is interested in attempting the Golf a number bigger than TREE(3) but doesn't understand graph theory or can't comprehend the magnitude of TREE(3).
"Builtins are allowed, but you are encouraged to include a solution that does not use builtins." is good to me but doesnt that contradict the rule that answers should be competitive?
Anonymous
@Fatalize a) Choosing not to use a builtin is a perfectly fine reason for sub-optimality. b) The non-builtin versions would likely be included with the builtin solutions, rather than as standalone solutions, so it's a moot point anyway.
Who's the best pancake flipper!
Pancake flipping [description will be added] is NP-hard, so an optimal approach in terms of number of flips is hard to achieve. However, optimizing for speed should be doable.
You'll be given 5(?) lists of 30(?) randomly ordered integers that you shall sort in...
Given a square integer matrix as input, output the determinant of the matrix.
Rules
You may assume that all elements in the matrix, the determinant of the matrix, and the total number of elements in the matrix are within the representable range of integers for your language.
Outputting a decim...
Consider the following sequence:
1, 0, 1, 2, 4, 1, 6, 8, 0, 1, 2, 4, 6, 8, 1, 0, 2, 4, 6, 8, 1, 0, 2, 4, 6, 8, 0, 1, ...
The even digits start from 0 and are grouped into runs of increasing length. They are arranged cyclically, meaning that they are sorted in ascending order until 8 is reached...
@Fatalize I've always understood the "competitive" rule to be "competitive using that method." For example, iterative vs recursive could easily be two separate answers. Or run-length-encoding versus another string compression method.
@user202729 I posted by Jelly solution; would you care to explain how yours works? I'm interested in what your general approach is (no need to write out a full step-by-step, just approximately what the program does
@cairdcoinheringaahing the thing is user202729's code includes a bit that doesn't always make it recurse. Your example always recurses but that one breaks after a while
@cairdcoinheringaahing if () does something then spacing is still better because it doesn't modify functionality so you can just remove spaces when you're done, whereas with () after you're done you now have code that probably depends on the ()
do we have a question where you get a grid with lasers and receptors and a certain number of mirrors or other modifiers to place and try to solve a laser puzzle (or a similar challenge)
@cairdcoinheringaahing so is 2 invalid by this standard (still a valid float)